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

Solution (Python):
import sys
input = sys.stdin.readline
s=input().strip()
print("No" if len(set(list(s)))==1 else "Yes")

Solution (Python):
a = input().count("A")
if a == 3:
  print("No")
elif a == 0:
  print("No")
else:
  print("Yes")

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

Solution (Python):
print ("No" if input() in ("AAA", "BBB") 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 'A' in S and 'B' in S:
  print('Yes')
else:
  print('No')

Solution (Python):
s=input()
a=s.count('A')
b=3-a
if(a==1 or b==1):
    print('Yes')
else:
    print('No')

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

Solution (Python):
from collections import Counter
s=input()
c=Counter(s)
if(len(c.keys())==1):
    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) == 2:
    print('Yes')
else:
    print('No')

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

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

if "A" in l and "B" in l :
	print("Yes")

else :
	print("No")

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

Solution (Python):
s = input()
a = False
b = False

for c in s:
  if c == 'A':
    a = True
  else:
    b = True

if a and b:
  print("Yes")
else:
  print("No")

Solution (Python):
S = set(input())
if len(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):


import sys
import math
from math import sqrt


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

Solution (Python):


import sys
import math
from math import sqrt


N = str(input())
if N == "AAA" or N == "BBB":
    print("No")
else:
    print("Yes")

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

Solution (Python):


import sys
import math
from math import sqrt


N = str(input())
if N == "AAA":
    print("No")
elif N == "BBB":
    print("No")
else:
    print("Yes")

Solution (Python):
s = input()
if s.find('A') != -1 and s.find('B') != -1:
  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 == "AAA" or s == "BBB":
  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 = str(raw_input())
res = (S[0] == S[1] == S[2])
if res:
  print "No"
else:
  print "Yes"

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

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 == 'A'*3 or s == 'B'*3:
    print('No')
else:
    print('Yes')

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

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

Solution (Python):
s = input()
a = [c for c in s]

if a == ['A', 'A', 'A']:
  print("No")
elif a == ['B', 'B', 'B']:
  print("No")
else:
  print("Yes")

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

Solution (Python):
string = input()
key = 0
if(string[0] == string[1]):
    if(string[0] == string[2]):
        key = 1


if(key == 1):
    print('No')
else:
    print('Yes')

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

Solution (Python):
S = input()

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

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

Solution (Python):
s = input()
prev = s[0]
for i in s[1:]:
    if prev!=i:
        print("Yes")
        break
    prev = i
else:
    print("No")

Solution (Python):
s = input()

for i in range(len(s)):
    if s[i-1] != s[i]:
        print('Yes')
        exit()
print('No')

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

Solution (Python):
S = input()

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

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

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

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

Solution (Python):
S = input()
flag = False
for i in range(3):
    if S[i] != S[0]:
        flag = True

if flag:
    print('Yes')
else:
    print('No')

Solution (Python):
str_ = input()
print('Yes') if 'A' in str_ and 'B' in str_ 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 = input()
if S[0] == 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):
n = input()

if n == "AAA" or n == "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):
a = 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 = set(input())
if len(s) == 1:
  print('No')
else:
  print('Yes')

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

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

Solution (Python):
if __name__ == '__main__':
    s = input()
    ans = 0
    for i in range(len(s)-1):
        if s[i] != s[i+1]:
            ans += 1
    if ans == 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()
if s == 'AAA' or s == 'BBB':
    print('No')
else:
    print('Yes')

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

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

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

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

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

Solution (Python):
S = input()
NS = [0]*len(S)
for i in range(len(S)):
    NS[i] = S[i]




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

Solution (Python):

print("Yes") if len(set(input())) > 1 else print("No")

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

Solution (Python):
s = input()

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

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

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 = str(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 '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()
station=set(S)
if len(station)>1:
    print('Yes')
else:
    print('No')

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

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

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

Solution (Python):
s = input()

if s[0:3] == "AAA" or s[0:3] =="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):
a = input().strip()
A = a.count("A")
B = len(a)-A
if A and B:
  print("Yes")
else:
  print("No")

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

Solution (Python):
import collections
s=list(input())
c=collections.Counter(s)
print("Yes" if len(c)==2 else "No")

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

Solution (Python):
"""
    Author: _YL_
"""

lst = list(input())

n = len(lst)

i = 1
while i < n and lst[i] == lst[i-1]: i += 1

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

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

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

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    s=STR()
    s=set(s)
    if len(s)==1:
        print('No')
    else:
        print('Yes')
if __name__ == '__main__':
    do()

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

Solution (Python):
A=str(input())
if A=="AAA":
  print("No")
elif A=="BBB":
  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=str(input())

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

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

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

Solution (Python):
import sys

S = str(input())

before = S[0]
for s in S:
   if s != before:
      print('Yes')
      sys.exit()
   before = s

print('No')

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

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

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

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

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

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

Solution (Python):
from collections import Counter
s = input()

a = False
b = False
for i in s:
    if i == "A":
        a = True
    elif i == "B":
        b = True

if a and b:
    print("Yes")
else:
    print("No")

Solution (Python):
i = input()
if "A" in i and "B" in i:
  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 == "AAA" or S == "BBB" else print("Yes")

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

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

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

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

Solution (Python):
t = input()
l = [i for i in t]
if "A" in l and "B" in l:
    print("Yes")
else:
    print("No")

Solution (Python):
l = input()
n = len(l)
stat = "No"
for i in range(n-1):
    if l[i] != l[i+1]:
        stat = "Yes"
        break

print(stat)

Solution (Python):
l = input()
if l[0] == l[1] == l[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):
def solve():
  s = input()
  if s[0] == s[1] == s[2]:
    print("No")
  else:
    print("Yes")
  return 0

if __name__ == "__main__":
  solve()

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

Solution (Python):
from collections import deque,defaultdict,Counter
from bisect import bisect_left,bisect_right,insort_left,insort_right
from heapq import heapify,heappop,heappush
from fractions import gcd
from copy import deepcopy
from itertools import accumulate,groupby,permutations,combinations
from math import ceil,sqrt,cos,sin,pi

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

if __name__ == '__main__':
    main()

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

Solution (Python):
def getInput():
    return list(input().rstrip())

S = getInput()
a = ['A' for i in range(3)]
b = ['B' for i in range(3)]

if (a == S or b == S): print('No');
else: print('Yes');

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

Solution (Python):
a = [s.split() for s in open(0)][0]
a = [s for s in a[0]]
if len(set(a)) != 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):

"""
Challenge A
"""
import numpy as np

def bus(stations):
    a = np.array(("","",""))
    for i in range(3):
        a[i] = stations[i]
    s = np.unique(a)
    if len(s)==1:
        return "No"
    elif len(s) > 1:
        return "Yes"
    else:
        return "Problem"
        
"""
my_strings = np.array(("AAA","AAB","ABA","BAA","ABB","BBA","BBB"))
for i in my_strings:
    print(i)
    print(bus(i))
"""
    
i = input()

print(bus(i))

Solution (Python):
import sys

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

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

Solution (Python):

import sys
s = sys.stdin.readline().rstrip()

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

Solution (Python):


import sys

def prob_a(s):
    chars = list(s)
    tmpc = chars[0]
    for c in chars[1:]:
        if c == tmpc:
            continue
        else:
            print('Yes')
            return 0
    print('No')

if __name__ == '__main__':
    s = input()
    prob_a(s)

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

Solution (Python):

d = list(input())
qa = 'Yes'
if d.count('A') == 3 or d.count('B') == 3:
    qa = 'No'
print(qa)

Solution (Python):








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

Solution (Python):

S = input()


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

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

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):
a = input()
if a == "AAA" or a == "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 "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()
print("No" if S[0]==S[1]==S[2] else "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[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):
def main():
    N = input()
    if 'AAA' in N or 'BBB' in N:
        print("No")
    else:
        print('Yes')

if __name__ == "__main__":
    main()

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

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

Solution (Python):
def station(comp):
   if(len(set(comp)) == 1):
      print("No")
   else:
      print("Yes")

station(input())

Solution (Python):
states = input()
if states.find('A') < 0 or states.find('B') < 0:
    print('No')
else:
    print('Yes')

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

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

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

Solution (Python):
S=input()
if S.count("B")==3 or S.count("A")==3:
  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):
def main():
    s = list(input())
    s_set = set(s)

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


if __name__ == "__main__":
    main()

Solution (Python):
input_lines=input()
word='No'
for i in range(2):
    if not input_lines[i]==input_lines[i+1]:
        word='Yes'
print(word)

Solution (Python):
s = input()

curr_c = s[0]
ans = "No"
for c in s[1:]:
    if(c!=curr_c):
        ans = "Yes"
        break

print(ans)

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

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

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

Solution (Python):
s = input()

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

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

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

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

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

Solution (Python):
input_line = input()
X = str(input_line)
if (X) == ('AAA'):
  print('No')
elif (X) == ('BBB'):
    print('No')
else:
	print('Yes')

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

Solution (Python):
unkoujyokyo=input()
if unkoujyokyo == 'AAA':
  print('No')
elif unkoujyokyo == 'BBB':
  print('No')
else:
  print('Yes')

Solution (Python):
a = input().count('A')
if a != 0 and a != 3:
    print('Yes')
else:
    print('No')

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

Solution (Python):
s = input()
r = 'Yes'
for c in s:
	if s.count(c) == 3:
		r = 'No'
		break
print(r)

Solution (Python):

s = input()

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

Solution (Python):
str = input().strip()
if(str[0] == str[1] and str[1] == str[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):
if len(set(input())) == 1:
    print('No')
else:
    print('Yes')

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

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

Solution (Python):
arr = input()
cnt = 0
for a in arr:
    if a == 'A':
        cnt += 1

if cnt == 0 or cnt == len(arr):
    print("No")
else:
    print("Yes")

Solution (Python):
def main(x):
    a = False
    if 'A' in x:
        if 'B' in x:
            if len(x) == 3:
                a = True
    return a

if __name__ == "__main__":
    x = input()
    v = main(x)
    if v:
        print("Yes")
    else:
        print("No")

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

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

if len(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 len(set(s)) == 1:
    print('No')
else:
    print('Yes')

Solution (Python):
from copy import deepcopy
from sys import exit,setrecursionlimit
import math
from collections import defaultdict,Counter,deque
from fractions import Fraction as frac
import fractions
from functools import reduce
from operator import mul
import bisect
import sys
import logging
import heapq
import itertools

logging.basicConfig(level=logging.ERROR)

input = sys.stdin.readline

setrecursionlimit(1000000)


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

main()

Solution (Python):
S = input()
if S == "AAA" or S == "BBB":
  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):
a = input()
b = a[0]
c = False
for i in range(len(a)):
    if a[i] != b:
        c = True
if c:
    print("Yes")
else:
    print("No")

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

if s.count('A') and s.count('B'):
    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" or s=="BBB":
    print("No")
else :
    print("Yes")

Solution (Python):
print('YNeos'[input()in("AAA","BBB")::2])

Solution (Python):
a,b,c=input()
if a==b and b==c:
  print("No")
else:
  print("Yes")

Solution (Python):
def f():
    S = raw_input()
    return 'Yes' if len(set(S)) == 2 else 'No'

print(f())

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

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

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

if a == b == c:
    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):
a,b,c = input()
if a==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 = list(input())
if s[0] == s[1] and s[1] == s[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):
s = input()
if s == "AAA" or s == "BBB":
  print("No")
else:
  print("Yes")

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

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

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

Solution (Python):
s = input()

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

Solution (Python):
c = sorted(input())
 
if c[0]=='A' and c[2]=='B':
  print('Yes')
else:
  print('No')

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

Solution (Python):
s = 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 = input()

s = sorted(s)

if s[0] == 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):
print("Yes")if len(set(list(input())))==2else 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=='AAA' or S=='BBB':
    print('No')
else:
    print('Yes')

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

Solution (Python):
line = input()

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

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

Solution (Python):




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

Solution (Python):
S = input()
print("No" if S.count("A") == 3 or S.count("B")  ==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[0] == S[1] and 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):
S = input()
if S == 'AAA' or S == 'BBB':
    print('No')
else:
    print('Yes')

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

Solution (Python):
import sys
n=input()
j=0

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

Solution (Python):
S=input()
f=1
for i in range(1,3):
	if (S[i]!=S[0]):
	    f=0
if(f==0):
  print("Yes")
else:
  print("No")

Solution (Python):
print("YNeos"[input() in['AAA','BBB']::2])

Solution (Python):
line = input()
char_list = list(line)

if "A" not in char_list or "B" not in char_list :
  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 = str(input())

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

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

Solution (Python):

import os, sys

S = str(input())
ans = len(set(S))

print("No") if ans == 1 else print("Yes")

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

Solution (Python):


import sys

sys.setrecursionlimit(10 ** 6)


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

main()

Solution (Python):


import sys

sys.setrecursionlimit(10 ** 6)


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

main()

Solution (Python):
input_line = input("")
a_num = 0
b_num = 0
for c in input_line:
  if c == "A":
    a_num += 1
  else:
    b_num += 1

if a_num*b_num > 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()

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):
s = input()
s1 = s[0]
s2 = s[1]
s3 = s[2]

if s1 == s2:
  if s1 == s3:
    print('No')
    exit()
print('Yes')

Solution (Python):
S = input()

S_list = [i for i in S]
S_set = set(S_list)

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

Solution (Python):
s = input()

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

Solution (Python):
S=list(input())
count=0
for i in range(2):
  if not S[i]==S[i+1]:
    count+=1
if count >= 1:
  print('Yes')
else:
  print('No')

Solution (Python):
S = input()
for i in range(2):
    if  S[i] == S[i+1]:
        pass
    else:
        print("Yes")
        exit()
print("No")

Solution (Python):
s=input()
s=list(s)
if "A" not in s or "B" not in s:
  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 == "AAA" or s == "BBB":
    print("No")
else:
    print("Yes")