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):
S = input()
if S[0] != S[1] or S[1] != S[2]:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
if ('A' in s) & ('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_cnt = 0
b_cnt = 0
for i in range(3):
  if s[i] == 'A':
    a_cnt += 1
  elif s[i] == 'B':
    b_cnt += 1
if a_cnt > 0 and b_cnt > 0:
  print('Yes')
else:
  print('No')

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

Solution (Python):
i = input()
if i[-1]==i[-2] and i[-2]==i[-3]:
    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):
S = input()

if "A" in S and "B" in S:
    print("Yes")
else:
    print("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[0] == 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()

if (S[0] == S[1] and S[1] == S[2] and S[2] == S[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("YNeos"[s=="AAA" or s=="BBB"::2])

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

if str1 == 'AAA' or str1 == 'BBB':
    print('No')
    exit()
    
print('Yes')

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):
def main():
    s = input()
    if s != "AAA" and s != "BBB":
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()

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

Solution (Python):
s = input()

a = s[0]

flag = False
for i in range(1, 3):
  if s[i] != a:
    flag = True
    break
    
if flag:
  print('Yes')
else:
  print('No')

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

s = set(s)

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

Solution (Python):
import sys
S = input()
cond = (S=="AAA") | (S=="BBB")
ans = "No" if cond else "Yes"

print(ans)

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 s.count('A')==0 or s.count('B')==0:
  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()
ca = S.count("B")
cb = S.count("A")

if  ca == 3 or cb == 3:
  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=lambda:sys.stdin.readline().rstrip();aint=lambda:int(input());ints=lambda:list(map(int,input().split()))
import math;floor,ceil=math.floor,math.ceil
from collections import deque
Yes=lambda b:print('Yes')if b else print('No');YES=lambda b:print('YES')if b else print('NO')
is_even=lambda x:True if x%2==0 else False

def main():
  s=input()
  Yes(s[0]!=s[1]or s[2]!=s[1]or s[0]!=s[2])

if __name__ == '__main__':
  main()

Solution (Python):
s = input()
x={}
for i in s:
    if i not in x:
        x[i]=1
    else:
        x[i]+=1
count=0
for i in list(x.values()):
    count+=1
if(count==2):
    print("Yes")
else:
    print("No")

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

Solution (Python):
if input() in ["AAA","BBB"]:
  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()
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):
import sys

s = input()

if s[0]==s[1]==s[2]:
    print("No")
    sys.exit()

else :
    print("Yes")

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

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

Solution (Python):
import sys

input = sys.stdin.readline

S=input()

cnt_a = S.count('A')
cnt_b = S.count('B')

if cnt_a>0 and cnt_b>0:
    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('Yes') if all(['A' in S, 'B' in S]) else print('No')

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

Solution (Python):
S = list(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 = str(input())
if s == "AAA":
  print("No")
elif 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[0] == S[1] and S[1] == S[2]:
  print("No")
else:
  print("Yes")

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

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

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

Solution (Python):
print('YNeos'[len(set(input()))==1::2])

Solution (Python):
S = input()

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

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

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

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

Solution (Python):
x=input()

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

Solution (Python):
def main():
    S=input()
    if S=="AAA" or S=="BBB":
        print("No")
    else:
        print("Yes")
if __name__ == '__main__':
    main()

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

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

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

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

Solution (Python):
import sys
s = sys.stdin.readline().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):
stations = set(str(input()))
if len(stations) == 1:
    print ("No")
else:
    print ("Yes")

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

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

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

Solution (Python):
S1,S2,S3 = input()
if S1 == S2 == S3 :
    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' and S != 'BBB':
    print('Yes')
else :
    print('No')

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


def solve():
    s = set(list(input()))
    if len(s) == 1: 
        print('No')
    else:
        print('Yes')


if __name__ == '__main__':
    solve()

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=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 = input()
print("Yes" if "A" in S and "B" in S else "No")

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

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

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

if s[0]==s[1] and s[1]==s[2]:
    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 'A' in S and 'B' in S:
    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 len(set(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()
print('Yes' if 'A' in s and 'B' in s else 'No')

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

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

Solution (Python):
s = input()

if s == 'AAA':
	print('No')
elif s == 'BBB':
	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 = input()

if len(set(s)) == 1:
    ans = "No"
else:
    ans = "Yes"
print(ans)

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

Solution (Python):
str  = input()
a = False
b = False
for ch in str:
    if ch == 'A':
        a = True
    else:
        b = True
if a and b:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
from copy import copy
input = sys.stdin.readline
'''
n, m = map(int, input().split())
n = int(input())
A = list(map(int, input().split()))
S = input().strip()
for test in range(int(input())):
'''
inf = 100000000000000000  
mod = 998244353

S = input().strip()
for i in range(1,len(S)):
    if S[i]!=S[i-1]:
        print("Yes")
        sys.exit()
print("No")

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

Solution (Python):
s=input()

if s[0]==s[1]and s[1]==s[2]:

    print("No")

else:print("Yes")

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

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

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

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

Solution (Python):
s = input()

num = len(set(s))  

if num == 1:
    print("No")
else:
    print("Yes")

Solution (Python):
s = input()
n = len(s) 

a_only = "A" * n 
b_only = "B" * n 

if s == a_only or s == b_only:
    print("No")
else:
    print("Yes")

Solution (Python):
s = input()

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

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

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

Solution (Python):
l = list(map(str, input()))

if len(set(l)) == 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[2] and s[0] == s[1]:
  	print("No")
else:
  print("Yes")

Solution (Python):
import sys
input = sys.stdin.readline
input = sys.stdin.buffer.readline

def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def LI(): return list(map(int,input().split()))
def TI(): return tuple(map(int,input().split()))


def main():
    N = input()
    N = str(N)
    Sa = N.count("A")
    if Sa == 1 or Sa == 2:
        print("Yes")
    else:
        print("No")



if __name__ == "__main__":
	main()

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

Solution (Python):
x = input()
flg = 0
for i in x:
  for j in x:
    if i != j:
      flg = 1
if flg == 1:
  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 len(set(S)) == 2:
  print("Yes")
else:
  print("No")

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

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

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

Solution (Python):
S = list(input())
S = list(set(S))
if len(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[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()
if s[0]==s[1] and s[1]==s[2]:
    print("No")
else:
    print("Yes")

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

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

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

Solution (Python):
s=input()
S=[]
for i in range(3):
    S.append(s[i])
a=set(S)
if len(a)==1:
    print("No")
else:
    print("Yes")

Solution (Python):
S = input()

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

Solution (Python):

list_station = list(input())


text = "No"
i = 0


while i < len(list_station) - 1:
    if list_station[i] != list_station[i+1]:
        text = "Yes"
        break
    else:
        i += 1


print(text)

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

Solution (Python):
s = input()
flag = False
if (s[0] == 'A' and s[1] == 'B') or (s[0] == 'B' and s[1] == 'A'):
    flag = True

if (s[1] == 'A' and s[2] == 'B') or (s[1] == 'B' and s[2] == 'A'):
    flag = True

if flag:
    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[0] == S[1] and S[1] == S[2]:
    print('No')
else:
    print('Yes')

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[0] == s[1] and s[1] == s[2]:
  print('No')
else:
  print('Yes')

Solution (Python):
station = [char for char in input()]

station_set = set(station)
if len(station_set) == 2:
    print('Yes')
else:
    print('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[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.__contains__("AAA") or S.__contains__("BBB"):
    print("No")
else:
    print("Yes")

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

Solution (Python):

import sys
import math
import numpy as np

S = input()

if S.find("A") != -1 and S.find("B") != -1:
    print("Yes")
else:
    print("No")

Solution (Python):
temp = input()

judgment1 = 'A' in temp
judgment2 = 'B' in temp

if judgment1 == True:
    if judgment2 == True:
        print("Yes")
    else:
        print("No")
else:
    print('No')

Solution (Python):
a = str(input())
if a == 'AAA' or a == '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.find("A") == -1 or s.find("B") == -1:
    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" or S == "BBB":
  print("No")
else:
  print("Yes")

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

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

Solution (Python):
S = input()

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

Solution (Python):
from sys import stdin


if __name__ == "__main__":
    _in = [_.rstrip() for _ in stdin.readlines()]
    S =     _in[0]   
    
    TF = 'Yes' if 'A' in S and 'B' in S else 'No'
    
    print(TF)

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

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

Solution (Python):
S = input()
flag = 0
for i in range(len(S)-1):
    if S[i+1] != S[i]:
        flag = 1

if flag == 0:
    print("No")
else:
    print("Yes")

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

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

Solution (Python):
S = input()

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

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

Solution (Python):
def main():
  S = input()
  if "A" in S and "B" in S:
    print("Yes")
    exit(0)
    
  print("No")
main()

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

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

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

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

Solution (Python):
chaine = input()
repA = 0
repB = 0

for i in chaine:
  if i=='A':
    repA += 1 
  else: 
    repB += 1 

if repB==3 or repA==3:
  print("No")
else:
  print("Yes")

Solution (Python):
s=input()

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

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

Solution (Python):

url = "https://atcoder.jp//contests/abc158/tasks/abc158_a"

def main():
    t = input()
    if 'A' in t and 'B' in t:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Solution (Python):
s = input()

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

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

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

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

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

Solution (Python):


import sys



















def main():
    mod = 1000000007                  
    inf = float('inf')
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():  return int(input())
    def mi():  return map(int, input().split())
    def mi_0(): return map(lambda x: int(x)-1, input().split())
    def lmi(): return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():  return list(input())
    
    
    s = set(li())
    print('No') if len(s) == 1 else print('Yes')

if __name__ == "__main__":
    main()

Solution (Python):
S = input()
print('No' if S.count('A') == 0 or S.count('A') == 3 else '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):
s = set(input())
if len(s) > 1:
    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):
import sys
s = input()

for i in range(2):
  for j in range(1, 3):
    if s[i] != s[j]:
      print('Yes')
      sys.exit()

print('No')

Solution (Python):

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

Solution (Python):
from collections import deque, Counter as cnt
from collections import defaultdict as dd
from operator import itemgetter as ig
from bisect import bisect_right as bsr
from math import factorial, ceil, floor
import sys
sys.setrecursionlimit(1000000)


args = None
INF = float("inf")
MOD = int(1e9 + 7)


def input(*ps):
    if type(ps[0]) is list:
        return [input(*ps[0][:-1]) for _ in range(ps[0][-1])]
    elif len(ps) == 1:
        return ps[0](next(args))
    else:
        return [p(next(args)) for p in ps]


def nlist(n, v):
    if not n:
        return [] if type(v) is list else v
    return [nlist(n[1:], v) for _ in range(n[0])]


def yesno(v):
    print(["Yes", "No"][not v])



def main():
    S = set(input(str))
    yesno(len(S) == 2)


if __name__ == '__main__':
    args = iter(sys.stdin.read().split())
    main()

Solution (Python):
s = input()

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

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

Solution (Python):
S = input()


def main():
    j = True

    for i in range(len(S)):
        if S[0] != S[i]:
            j = False
        else:
            continue

    if j:
        print("No")
    else:
        print("Yes")




if __name__ == '__main__':
    main()

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

Solution (Python):
def Main(S):
    return "Yes" if 'A' in S and 'B' in S else "No"
    
def main():
    S = str(input())
    print(Main(S))

if __name__ == '__main__':
    main()

Solution (Python):
m = input()
if m == 'AAA' or m == '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 S=='AAA' or S=='BBB':
    print('No')
else:
    print('Yes')

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

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

Solution (Python):
from sys import stdin
N = list((stdin.readline().strip()))
if N[0]!=N[1] or N[1]!=N[2]:print("Yes")
else:print("No")

Solution (Python):
S = input()

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

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

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

Solution (Python):


from collections import defaultdict

con = 10 ** 9 + 7

def getlist():
	return list(map(int, input().split()))


def main():
	S = list(input())
	if S.count("A") == 3 or S.count("B") == 3:
		print("No")
	else:
		print("Yes")



if __name__ == '__main__':
	main()

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

Solution (Python):
import math

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):
stations = input()

if stations == "AAA" or stations == "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()
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 = set(list(input()))
if len(S) > 1:
    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):


def main():
    *S, = map(str, open(0).read().split())
    S = S[0]
    if (S == "AAA" or S == "BBB"):
        print("No")
    else:
        print("Yes")


main()

Solution (Python):
def main():
  x = input()

  num = 0
  for i in range(len(x)):
    if(x[0] != x[i]):
      num = 1

  if(num == 0):
    print('No')
  else:
    print('Yes')
    
if __name__ == '__main__':
  main()

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()
a=S.count("A")
b=S.count("B")
if a == 0 or b == 0:
  print ("No")
else:
  print ("Yes")

Solution (Python):
def main():
    args = input().rstrip().split(' ')
    S = [c for c in args[0]]
    if(S[0]==S[1] and S[0]==S[2] and S[1]==S[2]):
        print('No')
    else:
        print('Yes')
    
if __name__ == "__main__":
    main()

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

Solution (Python):
x = input()

if x[0]==x[1]==x[2]:
  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):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

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

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

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

if bus[0]==bus[1]==bus[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=str(input())

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

Solution (Python):



S = input()

l = []

for i in range(3):
  l.append(S[i])

s = set(l)

if len(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 "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()
z=0
for i in range(2):
  if s[i]==s[i+1]:
    z+=1
if z==2:
  print('No')
elif z<2:
  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):

def main():
    s = input()
    if s[0] == s[1] == s[2]:
        print("No")
    else:
        print("Yes")
if __name__ == '__main__':
    main()

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

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

for s in S:
    seen.add(s)

print( 'Yes' if len(seen) == 2 else 'No' )

Solution (Python):
S = input()
a = S[0]
b = S[1]
c = S[2]

if a == 'B' and b == 'B' and c == 'B':
    print('No')
elif a == 'A' and b == 'A' and c == 'A':
    print('No')
else:
    print('Yes')

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

Solution (Python):
a, b, c = input()

if a==b==c:
    print('No')
else:
    print('Yes')

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

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[0]==S[1]==S[2]:
    print('No')
else:
    print('Yes')

Solution (Python):
s = list(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 'A' in S and 'B' in S:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):
s = input()
for i in range(2):
    if s[i] != s[i + 1]:
        print("Yes")
        exit(0)
print("No")

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

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

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

Solution (Python):
a, b, c = input()

if a == b and b == c:
    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()
l = list(s)
ans= "No"
for i in range(0,len(l)-1):
  if(l[i]!= l[i+1]):
    ans = "Yes"
    break
print(ans)

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

Solution (Python):
S = input()

if 'A' in S and 'B' in S:
    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 s[0] == s[1] == s[2]:
    print("No")
else:
    print("Yes")

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

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