Two Substrings (在字符串中查找某一段字符：strstr函数)

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.

Example

Input

ABA

Output

NO

Input

BACFAB

Output

YES

Input

AXBYBXA

Output

NO

Note

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".

题目大意：

判断所给的字符串中是否包含不重叠的“BA”“AB”两个字符串。

用strstr函数判断两次：一次先判断BA，一次先判断AB（因为一直是往后走的，有可能出现ABACCCCAB这种情况）

strstr(str1,str2) 函数用于判断字符串str2是否是str1的子串。如果是，则该函数返回str2在str1中首次出现的地址；否则，返回NULL。

#include<iostream>
#include<String>
using namespace std;
int i,j,k;
 
char s[100001];  
int main(){  
   char *c;  
   scanf("%s",&s);  
   if((c=strstr(s,"AB"))!=NULL&&strstr(c+2,"BA")!=NULL){  
        printf("YES\n");  
        return 0;  
   }  
   if((c=strstr(s,"BA"))!=NULL&&strstr(c+2,"AB")!=NULL){  
        printf("YES\n");  
        return 0;  
   }  
   printf("NO\n");  
}