Not simply beatiful strings

1000ms

262144K

Description:

Let's call a string adorable if its letters can be realigned in such a way that they form two consequent groups of equal symbols (note that different groups must contain different symbols). For example, ababa is adorable (you can transform it to aaabb, where the first three letters form a group of a-s and others — a group of b-s), but cccc is not since in each possible consequent partition letters in these two groups coincide.

You're given a string s. Check whether it can be split into two non-empty subsequences such that the strings formed by these subsequences are adorable. Here a subsequence is an arbitrary set of indexes of the string.

Input:

The only line contains s (1 ≤ |s| ≤ 10⁵) consisting of lowercase latin letters.

Output:

Print «Yes» if the string can be split according to the criteria above or «No» otherwise.

Each letter can be printed in arbitrary case.

Sample Input:

ababa

Sample Output:

Yes

Sample Input:

zzcxx

Sample Output:

Yes

Sample Input:

yeee

Sample Output:

No

Note:

In sample case two zzcxx can be split into subsequences zc and zxx each of which is adorable.

There's no suitable partition in sample case three.

Informação

Provedor Codeforces

Código CF955B