Shifted Character Balance

Youare given a string S consisting of lowercase English letters.

You are allowed to perform at most one operation:

Allowed Operation:

• Select any one character

• Change it to the next alphabet character

• 'z' changes to 'a'

Goal:

After performing at most one such operation, determine whether it is possible to make all characters in the string appear the same number of times.

• Return "YES" if equal frequency can be achieved

• Otherwise, return "NO"

📥 Input Format

• A single string S

📤 Output Format

• Return "YES" if all character frequencies can be made equal after at most one operation

• Otherwise return "NO"

⚙️ Constraints

• 1≤∣S∣≤1000001 \le |S| \le 1000001≤∣S∣≤100000

🧪 Examples

Input:

aabbcc

Output:

YES

Explanation: All characters already appear the same number of times, so no operation is needed.