A. Two Substringstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou 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).InputThe only line of input contains a string s of length between 1 and 105 consisting of uppercase Latin letters.OutputPrint "YES" (without the quotes), if string s contains two non-overlapping substrings "AB" and "BA", and "NO" otherwise.ExamplesInputABAOutputNOInputBACFABOutputYESInputAXBYBXAOutputNONoteIn 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".
InputABA
OutputNO
['brute force', 'dp', 'greedy', 'implementation', 'strings', '*1500']