codeforces day 2

C. Find and Replace

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given a string ss consisting of lowercase Latin characters. In an operation, you can take a character and replace all occurrences of this character with 00 or replace all occurrences of this character with 11.

Is it possible to perform some number of moves so that the resulting string is an alternating binary string††?

For example, consider the string abacabaabacaba. You can perform the following moves:

• Replace aa with 00. Now the string is 0b0c0b00b0c0b0.
• Replace bb with 11. Now the string is 010c010010c010.
• Replace cc with 11. Now the string is 01010100101010. This is an alternating binary string.

††An alternating binary string is a string of 00s and 11s such that no two adjacent bits are equal. For example, 010101010