Codeforces550A Two Substrings 暴力

题意：

给出一个串，若能找出一组AB和BA，且互不重合。

思路：

离散化后暴力找匹配。

#include 

using namespace std;
const int MAXN=1e5+10;
int flag1[MAXN];
int flag2[MAXN];
int main()
{
    //ios::sync_with_stdio(false);
    char a[MAXN];
    while(~scanf("%s",a)){
        memset(flag1,0,sizeof(flag1));
        memset(flag2,0,sizeof(flag2));
        int len=strlen(a);
        bool ans=0;
        int pp=-1;
        int ppp=-1;
        for(int i=0;i

Description

You are given string s. Your task is to determine if the given string s contains two non-overlapping substrings "AB" and "BA" (the substrings can go in any order).

Input

The only line of input contains a string s of length between 1 and 10⁵ consisting of uppercase Latin letters.

Output

Print "YES" (without the quotes), if string s contains two non-overlapping substrings "AB" and "BA", and "NO" otherwise.

Sample Input

Input

ABA

Output

NO

Input

BACFAB

Output

YES

Input

AXBYBXA

Output

NO

Hint

In the first sample test, despite the fact that there are substrings "AB" and "BA", their occurrences overlap, so the answer is "NO".

In the second sample test there are the following occurrences of the substrings: BACFAB.

In the third sample test there is no substring "AB" nor substring "BA".