Uniform Character Frequency

EASY10 pts

You are given a string consisting of lowercase English letters. Your task is to determine whether the string exhibits a balanced character distribution.

A string has a balanced character distribution if every distinct character that appears in the string occurs the exact same number of times as every other distinct character in the string.

In other words, if you count how many times each unique character appears, all these counts should be identical.

Return true if the string has a balanced character distribution, or false otherwise.

Example

Input

s = "abacbc"

Output

true

Explanation

The distinct characters are 'a', 'b', and 'c'. Character 'a' appears 2 times, 'b' appears 2 times, and 'c' appears 2 times. Since all characters occur exactly 2 times, the string has a balanced character distribution.

Example

Input

s = "aaabb"

Output

false

Explanation

The distinct characters are 'a' and 'b'. Character 'a' appears 3 times while 'b' appears only 2 times. Since the occurrence counts differ (3 ≠ 2), the string does not have a balanced character distribution.

Example

Input

s = "aaa"

Output

true

Explanation

There is only one distinct character 'a', which appears 3 times. With just a single character type, the frequency is trivially uniform, so the string has a balanced distribution.

Accepted0/0·0% Acceptance

Constraints

1 ≤ s.length ≤ 1000
s consists only of lowercase English letters (a-z).

Code

Visualizer

Solutions

14px

Test Cases3

Results

Submissions

s =

"aaa"

Loading problem...

Uniform Character Frequency (Easy) — Practice with Code Visualizer | OneNoughtOne

Uniform Character Frequency

Hints

Uniform Character Frequency

Hints