Snuke has a string S consisting of three kinds of letters: `a`, `b` and `c`.

He has a phobia for palindromes, and wants to permute the characters in S so that S will not contain a palindrome of length 2 or more as a substring. Determine whether this is possible.

Constraints

* 1 \leq |S| \leq 10^5
* S consists of `a`, `b` and `c`.

Input

Input is given from Standard Input in the following format:


S


Output

If the objective is achievable, print `YES`; if it is unachievable, print `NO`.

Examples

Input

abac


Output

YES


Input

aba


Output

NO


Input

babacccabab


Output

YES
#include <stdio.h>
int num[3];
int min(int x,int y)
{
    return (x>y?y:x);
}
int main()
{
    num[0]=num[1]=num[2];
    char s[100100];
    scanf("%s",s);
    for(int i=0;s[i];i++)
    {
        num[(s[i]-'a')]++;
    }
    int minn=min(num[0],min(num[1],num[2]));
    num[0]-=minn;
    num[1]-=minn;
    num[2]-=minn;
    if(num[0]>1||num[1]>1||num[2]>1)
    {
        printf("NO\n");
    }
    else
    {
        printf("YES\n");
    }
    return 0;
}
