Problem:
 Score : 100 points    Problem Statement In AtCoder City, there are three stations numbered 1 , 2 , and 3 .  Each of these stations is operated by one of the two railway companies, A and B. A string S of length 3 represents which company operates each station. If S_i is A , Company A operates Station i ; if S_i is B , Company B operates Station i .  To improve the transportation condition, for each pair of a station operated by Company A and one operated by Company B, there will be a bus service connecting them.  Determine if there is a pair of stations that will be connected by a bus service.      Constraints  Each character of S is A or B .  |S| = 3         Input Input is given from Standard Input in the following format:  S       Output If there is a pair of stations that will be connected by a bus service, print Yes ; otherwise, print No .        Sample Input 1 ABA      Sample Output 1 Yes  Company A operates Station 1 and 3 , while Company B operates Station 2 .  There will be a bus service between Station 1 and 2 , and between Station 2 and 3 , so print Yes .       Sample Input 2 BBA      Sample Output 2 Yes  Company B operates Station 1 and 2 , while Company A operates Station 3 .  There will be a bus service between Station 1 and 3 , and between Station 2 and 3 , so print Yes .       Sample Input 3 BBB      Sample Output 3 No  Company B operates all the stations. Thus, there will be no bus service, so print No .

Solution (Python):

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


def solve():
    S = input()
    if S == "AAA" or S == "BBB":
        print("No")
    else:
        print("Yes")


def main():
    solve()


if __name__ == '__main__':
    main()

Solution (Python):
print("No" if input() in ["AAA","BBB"] else "Yes")

Solution (Python):
S = input()

print('Yes' if S != 'AAA' and S != 'BBB' else 'No')

Solution (Python):
s = input()
if s == 'AAA' or s == 'BBB':
    print('No')
else:
    print('Yes')

Solution (Python):
s = list(input())
s = list(set(s))
print('Yes') if len(s) >1 else print('No')

Solution (Python):
a = input()
if a[0] == a[1] == a[2]:
  print("No")
else:
  print("Yes")

Solution (Python):
S = input()
if S[0] != S[1] or S[0] != S[2]:
    print('Yes')
else:
    print('No')

Solution (Python):
s=input()
if s[0]==s[1] and s[0]==s[2]:
    print("No")
else:
    print("Yes")

Solution (Python):
s = input()
if s == 'AAA' or s == 'BBB':
    print('No')
else:
    print('Yes')

Solution (Python):


def main():

    S = input()
    listS = S.split()

    if S[0] == S[1] and S[1] == S[2]:
        ans = 'No'

    else:
        ans = 'Yes'

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
S = input()

if S[0] == S[1] == S[2]:
    print('No')
else:
    print('Yes')

Solution (Python):
s = list(input())
if s[0] == s[1] == s[2]:
    print('No')
else:
    print('Yes')

Solution (Python):
s = list(input())

if s[0] == s[1] == s[2]:
    print('No')
else:
    print('Yes')

Solution (Python):
s = list(input())
if len(set(s))==1:
    print("No")
else:
    print("Yes")

Solution (Python):
S = input()
ans = 0
for i in range(3):
  if S[i] == "A":
    ans += 1

if ans == 3 or ans == 0:
  print("No")
else:
  print("Yes")

Solution (Python):


s = set(input())

if len(s)==1:
  print('No')
else:
  print('Yes')

Solution (Python):
S = input()
if S == 'AAA' or S == 'BBB':
    print('No')
else:
    print('Yes')

Solution (Python):


S = input()

bef = S[0]
for s in S[1:]:
  if s != bef:
    print("Yes")
    exit()
  else:
    bef = s
print("No")

Solution (Python):
from collections import defaultdict, deque
import sys, heapq, bisect, math, itertools, string, queue, copy, time
from fractions import gcd
import numpy as np
sys.setrecursionlimit(10**8)
INF = float('inf')
MOD = 10**9+7
EPS = 10**-7

s = input()
if s == 'AAA' or s == 'BBB':
    ans = 'No'
else:
    ans = 'Yes'

print(ans)

Solution (Python):
S=input()
if S[0] != S[1] or S[0] != S[2] or S[1] != S[2]:
    print("Yes")
else:
    print("No")

Solution (Python):
N=input()
if  all(n=='A'  for n in N):
  print('No')
elif all(n=='B' for n in N):
  print('No')
else:
  print('Yes')

Solution (Python):
s = input()

if s == "AAA" or s == "BBB":
  print("No")
else:
  print("Yes")

Solution (Python):
s = input()
print('Yes' if len(set(s)) > 1 else 'No')

Solution (Python):
str = input()

if str.count("A") in [0, 3]:
  print("No")
else:
  print("Yes")

Solution (Python):
s = input()
if s == "AAA" or s == "BBB":
    print("No")
else:
    print("Yes")

Solution (Python):
s=input()
if 'A' in s and 'B' in s:
  print('Yes')
else:
  print('No')

Solution (Python):
s = list(input())

if s[0] == s[1] == s[2]:
    print('No')

else:
    print('Yes')

Solution (Python):
s=input()
if s=="AAA" or s=="BBB":
  print("No")
else:
  print("Yes")

Solution (Python):
s = input()

if (s == 'AAA') | (s == 'BBB'):
    print('No')
else:
    print('Yes')

Solution (Python):
s=input()

if s=="AAA" or s=="BBB":
    print("No")
else:
    print("Yes")

Solution (Python):


from typing import *
import collections
import functools
import itertools
import math
import sys

INF = float('inf')
YES = "Yes"  
NO = "No"  


def solve(S: str):
    return [YES, NO][S[0] == S[1] == S[2]]


def main():

    sys.setrecursionlimit(10 ** 6)

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  
    print(f'{solve(S)}')


if __name__ == '__main__':
    main()

Solution (Python):
S = input()

if S == 'AAA' or S == 'BBB':
    print('No')
else:
    print('Yes')

Solution (Python):
l = len(set(list(input())))
if l == 1:
    print("No")
else:
    print("Yes")

Solution (Python):






s = input()

if s[0] != s[1] or s[1] != s[2] or s[0] != s[2]:
    print ("Yes")
else:
    print("No")

Solution (Python):
S = input()
if S=='AAA' or S=='BBB':
    print('No')
else:
    print('Yes')

Solution (Python):




















































global FLAG_LOG
FLAG_LOG = False


def log(value):
    
    
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    S = lines[0]
    
    
    
    
    
    
    
    
    
    

    if S == 'AAA' or S == 'BBB':
        result = 'No'
    else:
        result = 'Yes'

    return [result]



def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines



def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['ABA']
        lines_export = ['Yes']
    if pattern == 2:
        lines_input = ['BBA']
        lines_export = ['Yes']
    if pattern == 3:
        lines_input = ['BBB']
        lines_export = ['No']
    return lines_input, lines_export



def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode



def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    
    
    
    
    
    
    
    
    
    
    



if __name__ == '__main__':
    main()

Solution (Python):
S = input()
print('Yes' if 'A' in S and 'B' in S else 'No')

Solution (Python):
s = input()
print("No" if s in ["AAA", "BBB"] else "Yes")

Solution (Python):
s=input()
 
if s.count("A")==3 or s.count("B")==3:
	print("No")
    
else:
	print("Yes")

Solution (Python):
s = list(input())
if "A" in s and "B" in s:
  print("Yes")
else:
  print("No")

Solution (Python):
s = input()
if s in ['AAA', 'BBB']:
  print('No')
else:
  print('Yes')

Solution (Python):
a = input("")
if "A" in a and "B" in a:
  print("Yes")
else:
  print("No")

Solution (Python):


S = input()
if 'A' in S and 'B' in S:
  print('Yes')
else:
  print('No')

Solution (Python):
l=list()

l=list(map(str,input()))
ac=0
bc=0
for i in range(len(l)):
    if l[i] =='A':
        ac+=1
    else:
        bc+=1

if ac==0 or bc==0:
    print('No') 
else:
    print('Yes')

Solution (Python):
S = input()

if "AB" in S or "BA" in S:
    print("Yes")
else:
    print("No")

Solution (Python):
S=input()
if (S=="AAA") or (S=="BBB"):
    print("No")
else:
    print("Yes")

Solution (Python):
s = input()
if len(set(s)) == 1:
    print('No')
else:
    print('Yes')

Solution (Python):
print('Yes' if len(set(input()))==2 else 'No')

Solution (Python):
import sys
S = input()

if not ( len(S) == 3 and ( "A" in S or "B" in S)): sys.exit()

print('No') if S == 'AAA' or S == 'BBB' else print('Yes')

Solution (Python):
def main():
    s = input()
    if s[0] == s[1] == s[2]:
        print("No")
    else:
        print("Yes")


if __name__ == "__main__":
    main()

Solution (Python):
stations = input()
if 'A' in stations and 'B' in stations:
    print('Yes')
else:
    print('No')

Solution (Python):
S=input()

if S.count("A") and S.count("B"):
	print("Yes")
else:
	print("No")

Solution (Python):
s=input()
if(len(set(s))==2):print("Yes")
else:print("No")

Solution (Python):

import sys
import os
if sys.platform=="darwin":
	base = os.path.dirname(os.path.abspath(__file__))
	name = os.path.normpath(os.path.join(base, '../atcoder/input.txt'))
	sys.stdin = open(name)

l = list(input())

set_l = set(l)
if len(set_l)==1:
    print("No")
else:
    print("Yes")

Solution (Python):
s = input()
print('Yes' if s!='AAA' and s!='BBB' else 'No')

Solution (Python):
s = input()

if s=="AAA" or s=="BBB":
    print("No")
else:
    print("Yes")

Solution (Python):
S = input()

if S == "AAA" or S == "BBB":
    print("No")
else:
    print("Yes")

Solution (Python):
St = len(set(input()))

print('Yes' if St == 2 else 'No')

Solution (Python):
def station_and_bus():
    
    S = input()
    
    if 'A' in S and 'B' in S:
        return 'Yes'
    else:
        return 'No'

result = station_and_bus()
print(result)

Solution (Python):
s = input()

if s=='AAA' or s=='BBB' : print('No')
else : print('Yes')

Solution (Python):
S = list(input())
if S[0] == S[1] and S[1] == S[2] and S[2] == S[0]:
  print("No")
else:
  print("Yes")

Solution (Python):
print(' NYoe s'[len(set(input()))::2])

Solution (Python):
print('NYoe s'[len(set(input()))==2::2])

Solution (Python):
print("No" if len(set(input()))==1 else "Yes")

Solution (Python):
print('Yes' if len(set(input())) == 2 else 'No')

Solution (Python):
s = input()

if s == "AAA" or s == "BBB":
    print("No")
else:
    print("Yes")

Solution (Python):
s = input()

res = "No" if s == "AAA" or s == "BBB" else "Yes"
print(res)

Solution (Python):

import sys
import collections as cl


def II(): return int(sys.stdin.readline())


def MI(): return map(int, sys.stdin.readline().split())


def LI(): return list(map(int, sys.stdin.readline().split()))


def main():
    N = input()

    print("No" if N[0] == N[1] == N[2] else "Yes")


main()

Solution (Python):

import sys
import collections as cl


def II(): return int(sys.stdin.readline())


def MI(): return map(int, sys.stdin.readline().split())


def LI(): return list(map(int, sys.stdin.readline().split()))


def main():
    N = input()

    print("No" if N[0] == N[1] == N[2] else "Yes")


main()

Solution (Python):
s = input()
if s.count('A') == 0 or s.count('B') == 0:
  print('No')
else:
  print('Yes')

Solution (Python):
s = input().split()
x1=s[0][0]
x2=s[0][1]
x3=s[0][2]
flag = False
A = 'A'
B = 'B'
if x1==A and x2==A and x3==A:
    flag = True
elif x1==B and x2==B and x3==B:
    flag = True
else:
    flag = False
if (flag):
    result = 'No'
else:
    result = 'Yes'
print(result)

Solution (Python):
s = str(input())

if 'A' in s and 'B' in s:
  print('Yes')
else:
  print('No')

Solution (Python):
s = input()

print("Yes" if ("A" in s and "B" in s) else "No")

Solution (Python):
S=input()
if S=="AAA" or S=="BBB":
    print("No")
else:
    print("Yes")

Solution (Python):
s = list(input())
if s.count('A') == 3 or s.count('B') == 3:
  print('No')
else:
  print('Yes')

Solution (Python):
word = input()

if word[0] == word[1] and word[1] == word[2] and word[0] == word[2]:
    print("No")
else:
    print("Yes")

Solution (Python):
s = input()
if s == 'AAA' or s == 'BBB':
    print('No')
else:
    print('Yes')

Solution (Python):
import sys
input = sys.stdin.readline
s=input().rstrip()
if len(set(s))>1:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
ans = 'No'
if s[0] != s[1] or s[1] != s[2] or s[2] != s[0]:
    ans = 'Yes'
print(ans)

Solution (Python):
S=input()
if S[0]==S[1] and S[0]==S[2]:
  print('No')
else:
  print('Yes')

Solution (Python):
S = list(input())
bus = "No"
if ("A" in S)&("B" in S):
    bus = "Yes"
print(bus)

Solution (Python):
S = input()
if S == 'AAA' or S == 'BBB':
    print('No')
else:
    print('Yes')

Solution (Python):
S = input()
print("Yes" if len(set(S)) != 1 else "No")

Solution (Python):
s=input()
print("No" if s=="AAA" or s=="BBB" else "Yes")

Solution (Python):
S = input()

ans = 'Yes'

if (S == 'AAA') or (S=='BBB'):
  ans = 'No'
  
print(ans)

Solution (Python):
s =input()
if s[0] == s[1] and s[1]==s[2]:
  print("No")
else:
  print("Yes")

Solution (Python):
S=input()
if S == 'AAA' or S == 'BBB':
    print('No')
else:
    print('Yes')

Solution (Python):
S = input()

if S[0] == S[1] == S[2]:
    print("No")
else:
    print("Yes")

Solution (Python):
s = list(input())
if len(set(s)) == 2:
    print('Yes')
else:
    print('No')

Solution (Python):
a = list(input())
print("Yes" if len(set(a)) == 2 else "No")

Solution (Python):
s = input()
print("No" if s == "AAA" or s == "BBB" else "Yes")

Solution (Python):
S=str(input())
if S=='AAA' or S=='BBB':
  print('No')
else:
  print('Yes')

Solution (Python):
print('NYoe s'['AAA'<input()<'BBB'::2])

Solution (Python):
print('Yes' if 'AAA'<input()<'BBB' else 'No')

Solution (Python):
l = ['AAA', 'BBB']
if input() in l:
  print('No')
else:
  print('Yes')

Solution (Python):
d=input()
if d.count("A")==3 or d.count("B")==3: print("No")
else: print("Yes")

Solution (Python):
def main():
 s = input()
 if s[1] != s[0] or s[1] != s[2]:
     print('Yes')
 else:
     print('No')
main()

Solution (Python):
s = input()
q = min(s.count('A'),s.count('B'))

if q == 0:
  print('No')
else:
  print('Yes')

Solution (Python):
S = input()
print('Yes' if S.count('A') > 0 and S.count('B') > 0 else 'No')

Solution (Python):
s = input()
if s[0] == s[1] and s[1] == s[2]:
  print("No")
else:
  print("Yes")

Solution (Python):
s = input().strip()
if s == 'AAA' or s == 'BBB':
    print('No')
else:
    print('Yes')

Solution (Python):
s = input()

if s in ('AAA', 'BBB'):
    print('No')
else:
    print('Yes')

Solution (Python):
s = input()

if 'A' in s and 'B' in s:
  print('Yes')
else:
  print('No')

Solution (Python):
S=input()

if S=="AAA":
  print("No")
elif S=="BBB":
    print("No")
else:
  print("Yes")

Solution (Python):
S = input()

if "A" in S and "B" in S:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()

if s.count('A') == 3 or s.count('B') == 3:
    print('No')
else:
    print('Yes')

Solution (Python):
s = list(input())

if s.count("A") == 0 or s.count("B") == 0:
    print("No")
else:
    print("Yes")

Solution (Python):
s = input()

if 'A' in s and 'B' in s:
  print('Yes')
else:
  print('No')

Solution (Python):

s = input()
print("No " if s == "AAA" or s == "BBB" else "Yes")

Solution (Python):
s = input()
if 'A' in s and 'B' in s:
    print('Yes')
else:
    print('No')

Solution (Python):
line = list(input())
line.sort()
if line[0] == line[2]:
    print("No")
else:
    print("Yes")

Solution (Python):
s = input()

if (s == 'AAA') or (s == 'BBB'):
	print("No")
else:
	print("Yes")

Solution (Python):
if len(set(list(input())))==1:print('No')
else:print('Yes')

Solution (Python):
S=input()
l = ['AAA','BBB']

if S in l:
    print('No')
if S not in l:
    print('Yes')

Solution (Python):
S=list(input())
A=set(S)
if len(A)==1:
  print("No")
else:
  print("Yes")

Solution (Python):
N=str(input())
if N=='AAA' or N=='BBB':
    print('No')
else:
    print('Yes')

Solution (Python):
flg = len(set(input())) == 2
print('Yes' if flg else 'No')

Solution (Python):
s=input()
if s[0]=="A" and s[1]=="A" and s[2]=="A":
    print("No")
    exit()
if s[0]=="B" and s[1]=="B" and s[2]=="B":
    print("No")
    exit()
print("Yes")

Solution (Python):
S = input()
ans = "Yes"
if S == "AAA" or S == "BBB":
  ans = "No"
print(ans)

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    S = readline().strip()
    
    if S in ('AAA', 'BBB'):
        print('No')
    else:
        print('Yes')
    
    return


if __name__ == '__main__':
    main()

Solution (Python):
s = input()
if (s == "AAA" or s == "BBB"):
    print("No")
else:
    print("Yes")

Solution (Python):
S = list(input())
if len(set(S)) == 2:
    print("Yes")
else:
    print("No")

Solution (Python):
S = input()

if ("A" in S) and ("B" in S):
  print("Yes")
else:
  print("No")

Solution (Python):
s = input()
if(s == "AAA" or s == "BBB"):
  print("No")
else:
  print("Yes")

Solution (Python):
s=input()
a,b=0,0
for i in range(3):
  if(s[i]=='A'):
    a+=1
  else:
    b+=1
if(a>0 and b>0):
  print('Yes')
else:
  print('No')

Solution (Python):
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline

s = input().rstrip()

if s == 'AAA' or s == 'BBB':
    print("No")
else:
    print("Yes")

Solution (Python):
s = input()

if s == 'AAA' or s == 'BBB':
  print('No')
else:
  print('Yes')

Solution (Python):
s = input()
if s == 'AAA'or s == 'BBB':
    print('No')
else:
    print('Yes')

Solution (Python):
L = set(list(input()))
if len(L) == 1:
  print("No")
else:
  print("Yes")

Solution (Python):
s = list(input())
if s[0] == "A" and s[1] == "A" and s[2] == "A":
  print("No")
elif s[0] == "B" and s[1] == "B" and s[2] == "B":
  print("No")
else:
  print("Yes")

Solution (Python):
s = list()

S = input()

s = S

if s[0]!=s[1] or s[1]!=s[2] or s[2]!=s[1]:
    print('Yes')

else:
    print('No')

Solution (Python):
S = str(input())

if S.count("A") == 0 or S.count("B") == 0:
    print("No")
else:
    print("Yes")

Solution (Python):
S = input()
if S=="AAA" or S=="BBB":
  print("No")
else:
  print("Yes")

Solution (Python):
a=str(input())
if a[0]==a[1] and a[2]==a[0] :
    print('No')
else:
    print('Yes')

Solution (Python):
a = str(input())
if a[0] == a[1] != a[2]:
    print("Yes")
elif a[1] == a[2] != a[0]:
    print("Yes")
elif a[0] == a[2] != a[1]:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()

if s == 'AAA':
    print('No')
elif s == 'BBB':
    print('No')
else:
    print('Yes')

Solution (Python):
s=input()
if s!="AAA" and s!="BBB":
    print("Yes")
else:
    print("No")

Solution (Python):
S = list(input())
if S.count('A') == 3 or S.count('A') == 0:
    print('No')
else:
    print('Yes')

Solution (Python):
S = str(input())

if S == "AAA" or S == "BBB":
  print("No")
else:
  print("Yes")

Solution (Python):
S = input()
print('Yes' if 'A' in S and 'B' in S else 'No')

Solution (Python):
s = input()
print('No' if s[0] == s[1] and s[1] == s[2] else 'Yes')

Solution (Python):
s = input()
if s == "AAA" or s == "BBB":
    print("No")
else:
    print("Yes")

Solution (Python):
S = input()
if S.count('A') == 3 or S.count('B') == 3:
    print("No")
else:
    print("Yes")

Solution (Python):











s = input()
print("Yes" if ('A' in s and 'B' in s) else "No")

Solution (Python):
S = input()
ans = ''.join(set(S))
if len(ans) == 1:
    print('No')
else:
    print('Yes')

Solution (Python):
s=input()
if s.count('A') and s.count('B'): print('Yes')
else: print('No')

Solution (Python):
s = input()

if s[1]==s[2]==s[0]:
  print('No')
else:
  print('Yes')

Solution (Python):
S = set([x for x in input()])

if len(S) == 1:
    print('No')
else:
    print('Yes')

Solution (Python):
S = input()

if S[0]==S[1] and S[1]==S[2] and S[0]==S[2]:
    print('No')
else:
    print('Yes')

Solution (Python):
print('YNeos'[len({*input()})<2::2])

Solution (Python):
print('YNeos'[len({*input()})<2::2])

Solution (Python):
S = input()
if S=='AAA' or S=='BBB':
  print('No')
else:
  print('Yes')

Solution (Python):
s=input()

if s=="AAA" or s=="BBB":
    print("No")
else:
    print("Yes")

Solution (Python):
S = str(input())
print('No') if S == 'AAA' or S == 'BBB' else print('Yes')

Solution (Python):
print("Yes" if len(set(list(input()))) != 1 else "No")

Solution (Python):
s = input()
if "A" in s and "B" in s:
    print("Yes")
else:
    print("No")

Solution (Python):
A = input()

if not A[0] == A[1] == A[2]:
  print("Yes")
elif A[0] == "A" or "B" and A[1] == "A" or "B" and A[2] == "A" or "B":
  print("No")

Solution (Python):
station=input()

flg="No"
for i in range(2):
    if station[i]!=station[i+1]:
        flg="Yes"

print(flg)

Solution (Python):
station = input()
print("Yes" if "AB" in station or "BA" in station else "No")

Solution (Python):
S = input()
if S[0] != S[1] or S[1] != S[2]:
    print('Yes')
else:
    print('No')

Solution (Python):
S = input()
if S == "AAA" or S == "BBB":
  print("No")
else:
  print("Yes")

Solution (Python):
s = input()
if s.count("A") == 0 or s.count("B") ==0:
    print("No")
else:
    print("Yes")

Solution (Python):
S = input()
print('Yes' if S != 'AAA' and S != 'BBB' else 'No')

Solution (Python):
S = input()

if "A" in S and "B" in S:
  print("Yes")
else:
  print("No")

Solution (Python):
S=input()
print('No' if S[0]==S[1]==S[2] else 'Yes')

Solution (Python):
s=input()
if s=="AAA" or s=="BBB":
    print("No")
else:
    print("Yes")

Solution (Python):
S=list(input())
countA=0
countB=0
for i in range(3):
    if S[i]=="A":
        countA+=1
    else:
        countB+=1
if countA!=0 and countB!=0:
    print("Yes")
else:
    print("No")

Solution (Python):
S=list(input())
countA=0
countB=0
for i in range(3):
    if S[i]=="A":
        countA+=1
    else:
        countB+=1
if countA!=0 and countB!=0:
    print("Yes")
else:
    print("No")

Solution (Python):
s=input()
if s[0]==s[1] and s[1]==s[2]:
  print("No")
else:
  print("Yes")

Solution (Python):
s=input()

if s=="AAA" or s=="BBB":
  print("No")
  
else:
  print("Yes")

Solution (Python):
s = input()
if s.count("A") != 0 and s.count("B") != 0:
  print("Yes")
else:
  print("No")

Solution (Python):
print(['No','Yes'][len(set(input()))-1])

Solution (Python):
S = input()

if("A" in S and "B" in S):
  print("Yes")
else:
  print("No")

Solution (Python):
s=input()
if s=="AAA" or s=="BBB":
  print("No")
else:
  print("Yes")

Solution (Python):
s = input()
if(s == 'AAA' or s == 'BBB'):
	print('No')
else:
  print('Yes')

Solution (Python):
S = input()
if S=="AAA" or S=="BBB":
    print("No")
else:
    print("Yes")

Solution (Python):
s = list(input())
if len(set(s)) == 2:
    print("Yes")
else:
    print("No")

Solution (Python):
s = list(input())

if (s.count('A') == 3 or s.count('B') == 3):
  print('No')
else:
  print('Yes')

Solution (Python):
s = input()
if s[0]==s[1] and s[1]==s[2] and s[0]==s[2]:
  print("No")
else:
  print("Yes")

Solution (Python):
s = input()

prev = s[0]
for i in range(1, 3):
    if s[i] != prev:
        print('Yes')
        break
else:
    print('No')

Solution (Python):
S = input()
if "A" in S and "B" in S:
    print("Yes")
else:
    print("No")

Solution (Python):
S = input()

if S == 'AAA' or S == 'BBB':
    print('No')
else:
    print('Yes')

Solution (Python):
a=input()

if(a=='AAA' or a=='BBB'):
    print('No')
else:
    print('Yes')

Solution (Python):
s = input()
if s[0] == s[1] and s[1] == s[2]:
  print('No')
else:
  print('Yes')

Solution (Python):


import sys
input=sys.stdin.readline

def main():
    S=input()
    if "BA" in S or "AB" in S:
        print("Yes")
    else:
        print("No")
    
    
    
if __name__=="__main__":
    main()

Solution (Python):
s = input()
ans = 'Yes'

if(s == 'AAA' or s == 'BBB'):
    ans = 'No'

print(ans)

Solution (Python):
s = input()
a = set()
for x in s:
    a.add(x)
if len(a) == 1:
    print('No')
else:
    print('Yes')

Solution (Python):
a=list(input())
if all([i=='A' for i in a]) or all([i=='B' for i in a]):
  print('No')
else:
  print('Yes')

Solution (Python):
S = input()
print("Yes" if len(set(S)) != 1 else "No")

Solution (Python):
s = input()
print('No' if s.count('A') > 2 or s.count('B') > 2 else 'Yes')

Solution (Python):
S = input()

if 'A' in S and 'B' in S:
    print("Yes")
else:
    print("No")

Solution (Python):
S = input()
print('No' if S == 'AAA' or S == 'BBB' else 'Yes')

Solution (Python):
S = input()
if S[0] == S[1] == S[2]:
    print('No')
else:
    print('Yes')

Solution (Python):
import math
def main():
  s = input()
  
  if s == 'AAA' or s == 'BBB':
    print('No')
  else:
    print('Yes')
  
main()

Solution (Python):


s = list(str(input()))

if len(set(s)) == 2:
    print('Yes')
else:
    print(('No'))

Solution (Python):
s=input()
if s=="AAA" or s=="BBB":
  print("No")
else:
  print("Yes")

Solution (Python):
s = input()

print("No" if s[0] == s[1] == s[2] else "Yes")

Solution (Python):
import itertools
import functools
import math
from collections import Counter
from itertools import combinations

S=input()

if S=='AAA' or S=='BBB':
    print('No')
else:
    print('Yes')

Solution (Python):
s = input()
if (s == "AAA") | (s == "BBB") :
    print("No")
else:
    print("Yes")

Solution (Python):
a = input()
 
if a[0] == a[1] and a[0] == a[2]:
  print('No')
else:
  print('Yes')

Solution (Python):
S=input()
if S=="AAA" or S=="BBB":
    print("No")
else:
    print("Yes")

Solution (Python):
s = str(input())
apple = []
for i in s:
    apple.append(i)
print("Yes" if len(set(apple)) == 2 else "No")

Solution (Python):
s = input()

s_set = set(s)

if len(s_set) == 1:
  print('No')
else:
  print('Yes')

Solution (Python):

S = input()
if S[0]==S[1]==S[2]:
    print('No')
else:
    print('Yes')

Solution (Python):
print('No'if input() in ['AAA', 'BBB'] else 'Yes')

Solution (Python):
S = input()
print('No' if S.count('A') == 3 or S.count('B') == 3 else 'Yes')

Solution (Python):
S = list(input())

if S[0] == S[1] == S[2]:
    print('No')
else:
    print('Yes')

Solution (Python):
S = input()
if S =="AAA" or S =="BBB" :
    print("No")
else : print("Yes")

Solution (Python):
s=input()

ans='Yes'

a=s[0]
b=s[1]
c=s[2]

if a==b and b==c and a==c:
    ans='No'
print(ans)

Solution (Python):
s = input()
ans = "Yes"

if s[0]==s[1]==s[2]:
  ans = "No"

print(ans)

Solution (Python):
n=input()
if 'A' in n and 'B' in n:
    print('Yes')
else:
    print('No')

Solution (Python):
S=input()
if S=="AAA" or S=="BBB":
    print("No")
else: print("Yes")

Solution (Python):
s = input()
if len(set(s)) ==2:
    print("Yes")
else:
    print("No")

Solution (Python):
A = input()
if A[0]==A[1]==A[2]:
    print("No")
else:
    print("Yes")

Solution (Python):
S = input()
if S[0] == S[1] and S[1] == S[2]:
  print('No')
else:
  print('Yes')

Solution (Python):
S = input()

if S=='AAA' or S=='BBB':
    print('No')
else:
    print('Yes')

Solution (Python):
a = input()
if a == "AAA" or a == "BBB" :
	 print ("No")
else : print ("Yes")

Solution (Python):
inp=input()
if inp[0]==inp[1] and inp[1]==inp[2]:
  print("No")
else:
  print("Yes")

Solution (Python):
s = input()
if s == "AAA" or s == "BBB" :
  print ("No")
else : print ("Yes")

Solution (Python):
S = input()
if(('A' in S) and ('B' in S)):
    print('Yes')
else:
    print('No')

Solution (Python):
print('Yes') if len(set(input()))==2 else\
	print('No')

Solution (Python):
s = input()

if s == "BBB" or s == "AAA": print("No")
else: print("Yes")

Solution (Python):
s = input()

if s.count("A") in [len(s), 0]: print("No")
else: print("Yes")

Solution (Python):
def main():
    stop = list(input())

    a, b = 0, 0
    for i in stop:
        if 'A' == i:
            a+=1
        else:
            b+=1
    if a > 0 and b > 0:
        print('Yes')
    else:
        print('No')
main()

Solution (Python):
s=input()
if s[0]==s[1]==s[2]:
  print("No")
else:
  print("Yes")

Solution (Python):
S = input()
if S == 'AAA' or S == 'BBB': print('No')
else: print('Yes')

Solution (Python):
s = input()
if s == 'AAA' or s == 'BBB': print('No')
else: print('Yes')

Solution (Python):
s = input()
if s == 'AAA' or s == 'BBB':
    print('No')
else:
    print('Yes')

Solution (Python):
s = input()

if len(set(list(s))) == 2:
  print("Yes")
else:
  print("No")

Solution (Python):
if len(set(input()))==2:
  print("Yes")
else:
  print("No")

Solution (Python):
s=input()
if s[0]==s[1] and s[1]==s[2]:
	print("No")
else:
	print("Yes")

Solution (Python):
S = input()
if S[0] == S[1] and S[1] == S[2]:
	print('No')
else:
	print('Yes')

Solution (Python):
s=input()
print("YNeos"[s == len(s) * s[0]::2])

Solution (Python):
s = input()
if s[0] == s[1] and s[1] == s[2]:
    print("No")
else:
    print("Yes")

Solution (Python):
import sys 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
S = readline().decode()
if 'A' in S and 'B' in S:
    print('Yes')
else:
    print('No')

Solution (Python):
S=input()
if "AB" in S or "BA" in S:
  print("Yes")
else:
  print("No")

Solution (Python):
s = input()
ans = 'No'
if "A" in s and "B" in s: ans = 'Yes'
print(ans)

Solution (Python):
S = str(input())

if S == "AAA" or S == "BBB":
    print("No")

else:
    print("Yes")

Solution (Python):


s = input()
if ((s.count('A') == 2 and s.count('B') == 1) or (s.count('B') == 2 and s.count('A') == 1)):
    print("Yes")
else:
    print("No")

Solution (Python):
a=input()
if a=='AAA' or a=='BBB':
    print('No')
else:
    print('Yes')

Solution (Python):
S = input()
if 'A' in S and 'B' in S:
  print('Yes')
else:
  print('No')

Solution (Python):
S = input()
if S in ["AAA","BBB"]:
    print("No")
else:
    print("Yes")

Solution (Python):
s=set(input())
if len(s)==2:print('Yes')
else:print('No')

Solution (Python):
s = input()
print("No" if s == "AAA" or s == "BBB" else "Yes")

Solution (Python):
def main():
    s = input()
    print('No') if s[0] == s[1] and s[0] == s[2] else print('Yes')


if __name__ == "__main__":
    main()

Solution (Python):
x = set(list(input()))
if (len(x)>1):
      print('Yes')
else:
      print('No')

Solution (Python):
S = set(input())

if len(S)==1:
  print("No")
else:
  print("Yes")

Solution (Python):

a=input()

if (a=='AAA') or (a=='BBB'):
    print('No')
else:
    print('Yes')

Solution (Python):






s = input()

if s[0] == s[1] == s[2]:
    print("No")
else:
    print("Yes")

Solution (Python):
s = input()
print('Yes' if len(set(s)) == 2 else "No")

Solution (Python):
s=list(input())
print('Yes' if ('A' in s) and ('B' in s) else 'No')

Solution (Python):
S = str(input())

if S[0]==S[1] and S[1]==S[2]:
  print('No')
else:
  print('Yes')

Solution (Python):
S = input()

if S == "BBB" or S == "AAA":
    print("No")
    quit()

print("Yes")