{"raw_statement":[{"iden":"problem statement","content":"Snuke has a string $S$ consisting of three kinds of letters: `a`, `b` and `c`.\nHe 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."},{"iden":"constraints","content":"*   $1 \\leq |S| \\leq 10^5$\n*   $S$ consists of `a`, `b` and `c`."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$S$"},{"iden":"sample input 1","content":"abac"},{"iden":"sample output 1","content":"YES\n\nAs it stands now, $S$ contains a palindrome `aba`, but we can permute the characters to get `acba`, for example, that does not contain a palindrome of length $2$ or more."},{"iden":"sample input 2","content":"aba"},{"iden":"sample output 2","content":"NO"},{"iden":"sample input 3","content":"babacccabab"},{"iden":"sample output 3","content":"YES"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}