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 == '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=str(input())
if s =="AAA":
    print("No")
elif 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):
a = input()
c = 'No'
for i in range(2):
  if a[i] != a[i+1]:
    c = 'Yes'
    break
print(c)

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):
x = input()
if x[0] == x[1] == x[2]:
    print("No")

else:
    print("Yes")

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

Solution (Python):
strings = list(input())
if strings[0] == strings[1] and strings[1] == strings[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 = set(input())
print('Yes' if len(s)>1 else '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):
bus = input()
buses = []
for i in bus:
    buses.append(i)
ans = set(buses)
if len(ans) == 1:
    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())
c = 0
for i in range(0, 3):
    if S[i] == S[0]:
        c += 1
if c == 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 S == "AAA":
    print("No")
elif S == "BBB":
    print("No")
else:
    print("Yes")

Solution (Python):
s=input('')
e=0
if s[0]!=s[1]:
    e=e+1

if s[1]!=s[2]:
    e=e+1

if e>=1:
    print('Yes')
else:
    print('No')

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

Solution (Python):
print('NYoe s'[{'A','B'} <= set(input())::2])

Solution (Python):
import sys
s = input()
bf = s[0]
for i in s[1:]:
    if i != bf:
        print("Yes")
        sys.exit()
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 "A" in S and "B" in S:
  print("Yes")
else:
  print("No")

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

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 "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 == 'AAA':
    print('No')
elif S == 'BBB':
    print('No')
else:
    print('Yes')

Solution (Python):
a=input()
b="AAA"
c="BBB"
if a==b or a==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()

if "AB" in s or "BA" 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):


station = input()


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

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

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()

a = set()
for i in range(3):
    a.add(S[i])
if len(a) == 2:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):
s =input()

if s.count('A') == 3:
    print("No")
elif s.count('A') == 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):
a = input().split()
if a == ["ABA"] or a==["BAA"] or a==["AAB"] or a==["BBA"] or a==["BAB"] or a==["ABB"]:
    print('Yes')
else:
    print('No')

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

Solution (Python):
a,b,c = input()
k = [a,b,c]
import collections
c = collections.Counter(k)
if len(c) == 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 = str(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 ('A' in S)&('B' in S):
    print('Yes')
else:
    print('No')

Solution (Python):
s=input()
tmp=""
for i in s:
    if tmp != "":
        if tmp != i:
            print("Yes")
            exit()
    tmp = i
print("No")

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
printV = lambda x: print(*x, sep="\n")
printH = lambda x: print(" ".join(map(str,x)))
def IS(): return sys.stdin.readline()[:-1]
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 LI1(): return list(map(int1, sys.stdin.readline().split()))
def LII(rows_number): return [II() for _ in range(rows_number)]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]

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

if __name__ == '__main__':
	main()

Solution (Python):
s = input()
if s[0] == 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):
if input() in {"AAA", "BBB"}:
  print("No")
else:
  print("Yes")

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians

from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from functools import reduce
from bisect import bisect_left, insort_left
from heapq import heapify, heappush, heappop

INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())
MAP = lambda: map(int, INPUT().split())
S_MAP = lambda: map(str, INPUT().split())
LIST = lambda: list(map(int, INPUT().split()))
S_LIST = lambda: list(map(str, INPUT().split()))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7


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


if __name__ == '__main__':
    main()

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()

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

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

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

Solution (Python):
S=input()
a=S[0]
z=0
for i in range(len(S)):
    if a==S[i]:
        a=S[i]
    else:
        z=1

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

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

sta = list(s)
b = True

for i in sta:
    if sta.count(i) == len(sta):
        b = False

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

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

Solution (Python):
sss = list(input())
mozi = sss[0]
hantei = 0
for i in range(1,len(sss)):
    if sss[i] != mozi:
        hantei = 1
        break

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

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

Solution (Python):
import numpy as np
N = input()
if N=='BBB' or N=='AAA':
    print("No") 
else:
    print("Yes")

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

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

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

Solution (Python):
S = input().strip() ; 
s1 = set() ;

for s in S :
	s1.add ( s ) ; 

p = "Yes" if len(s1) >= 2 else "No" 
print ( p ) ;

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]) and (S[2]==S[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):
l=input()


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

Solution (Python):



from math import *
from copy import *
from string import *				
from random import *				
from sys import stdin
from sys import maxsize
from operator import *				
from itertools import *
from collections import Counter		
from collections import defaultdict 

'''

'''

def solve(l):
	n = len(l)
	

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

Solution (Python):
S = input()
unique_n = len(set([S[0], S[1], S[2]]))

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

Solution (Python):


S = input()

if len(set(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 'A' in s and 'B' in s:
    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):
l = input()
if 'A' in l and 'B' in l:
    print('Yes')
else:
    print('No')

Solution (Python):









import sys



ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)

def main():
    s = input()
    ss = set(s)

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

if __name__ == '__main__':
    main()

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

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

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

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

Solution (Python):
n=input()

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

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

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

a_count = 0
b_count = 0
for char in S:
    if char == 'A':
        a_count += 1
    else:
        b_count += 1

if ((a_count == 3) or (b_count == 3)):
    print("No")
else:
    print('Yes')

Solution (Python):
a = input()

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

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

Solution (Python):


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

if __name__ == '__main__':
    main()

Solution (Python):
import sys
S = input()
if S == 'AAA' or S == 'BBB':
    print('No')
    sys.exit()
print('Yes')

Solution (Python):
s = input()
print('YNeos'[s=='AAA' or s=='BBB'::2])

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)) == 1:
    print("No")
else:
    print("Yes")

Solution (Python):
import math
import string


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


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):  
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor











































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 in ["AAA", "BBB"]:
    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 len(list(set(list(S)))) > 1:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()

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

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

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

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


if __name__ == '__main__':
    solve()

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

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

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

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

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

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

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

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

Solution (Python):
N = list(input())
L = list(set(N))

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

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

Solution (Python):
s = input()

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

Solution (Python):
import sys
from io import StringIO
import unittest

doTest=0

def yn(n):
    if n==1:
        print("Yes")
    else:
        print("No")
    return

def resolve():
    readline=sys.stdin.readline

    
    
    s=readline().strip()

    if s[0]==s[1] and s[0]==s[2]:
        yn(0)
    else:
        yn(1)
    

    return

if doTest==0:
    resolve()
    sys.exit()

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

ans = "No"
a = s[0]
for i in s[1:]:
    if a != i:
        ans = "Yes"
    a = i

print(ans)

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

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

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 = open(0).read()

flag = "No"
for i in range(2):
    if s[i] != s[i + 1]:
        flag = "Yes"
        
print(flag)

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

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  


def solve(S: str):
    if S == "AAA" or S == "BBB":
        print(NO)
    else:
        print(YES)



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  
    solve(S)

if __name__ == '__main__':
    main()

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

Solution (Python):
s=list(input())
cnt=0
for i in range(3):
  if s[i]=='A':
    cnt+=1
if cnt==0 or cnt==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 S == 'AAA' or S == 'BBB':
    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()
dic = {"A":False,"B":False}
for c in s:
    dic[c] = True
if dic["A"] and dic["B"]:
    print("Yes")
else:
    print("No")

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

Solution (Python):
S=input()
b=[a for a in S]
count=0
suuji=0
for c in b:

    if c=='A':
        count+=1
    else:
        suuji+=1
if count==3 or suuji==3:
    print('No')
else:
    print('Yes')

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  


def solve(S: str):
    for i in range(2):
        if S[i] != S[i+1]:
            return "Yes"
    return "No"



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

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()
c = S.count('A')
if((c==3) | (c==0)):
    print("No")
else:
    print("Yes")

Solution (Python):
line = input()

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

Solution (Python):
print('Yes' if len(set(input()))>1 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]=='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();a=0;b=0
for i in range(len(s)) :
  if s[i]=="A" :
    a=a+1
  elif s[i]=="B" :
    b=b+1
if a>0 and b>0 :
  print("Yes")
else :
  print("No")

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

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

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

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

Solution (Python):
s = input()

l = set()
l.add(s[0])
l.add(s[1])
l.add(s[2])
if len(l)==2:
    print('Yes')
else:
    print('No')

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

Solution (Python):

def main():
    S = list(str(input()))
    if len(set(S))>1:
        print('Yes')
    else:
        print('No')

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 S.count('A')==3 or S.count('B')==3:
    ans = 'No'
else:
    ans = 'Yes'


print(ans)

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

Solution (Python):
import sys
range = xrange
input = raw_input

S = input()
if all(c == 'B' for c in S) or all(c == 'A' for c in S):
    print 'No'
else:
    print 'Yes'

Solution (Python):
S = input()
for i in range(len(S)-1):
    if S[i] != S[i+1]:
        print("Yes")
        exit()
    
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 = str(input())
if S == 'AAA':
    print('No')
elif S == 'BBB':
    print('No')
else:
    print('Yes')

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

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

print("Yes")

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

Solution (Python):
import sys


'''a,b= map(int,input().split())'''




N=str(input())
li=list(N)
i=0
for i in range(2):
  if(li[i]!=li[i+1]):
    print('Yes')
    sys.exit()
print('No')

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

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

Solution (Python):
s=list(input())
cnt = 0
for i in s:
    for j in s:
        if i != j:
            cnt +=1

if cnt == 0:
    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):
x = set(list(input()))
print('No' if len(x)==1 else 'Yes')

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

if len(set(sList)) == 1:
    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 "B" in s and "A" in s:
    print("Yes")
else:
    print("No")

Solution (Python):


eki = str(input())
if eki[0] == "A" and eki[1] == "A" and eki[2] == "A":
    print("No")
elif eki[0] == "B" and eki[1] == "B" and eki[2] == "B":
    print("No")
else:
    print("Yes")

Solution (Python):
n = input()
count = 0
for i in range(2):
    if n[i] == n[1 + i]:
        count += 1
    else:
        break
if count == 2:
    print("No")
else:
    print("Yes")

Solution (Python):
s = input().replace('A', '')
if (not s):
  print('No')
elif (s == 'BBB'):
  print('No')
else:
  print('Yes')

Solution (Python):
S = set()
for i in input():
    S.add(i)
if len(S) == 2:
    print("Yes")
else:
    print("No")

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]==s[2]:
  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.count('A')==3 or s.count('B')==3:
  print('No')
else:
  print('Yes')

Solution (Python):
N=input()
if N=="AAA" or N=="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()
print("Yes" if len(set(s))!=1 else "No")

Solution (Python):
s = input()

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

Solution (Python):
strin= input()

a = 0
b = 0

for kk in range(3):
    if strin[kk] == "A":
        a = 1
    if strin[kk] == "B":
        b = 1

if a == 1 and b == 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):
a,b,c=input()

if not a==b:
  print('Yes')
  exit()
elif not b==c:
  print('Yes')
  exit()
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):
S = input()
if S == "AAA":
    print("No")
elif S == "BBB":
    print("No")
else:
    print("Yes")

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

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

Solution (Python):
s=input()

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

Solution (Python):




def main():
    S = input()
    print('Yes'if 0 < S.count('A') < 3 else 'No')


if __name__ == "__main__":
    main()

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
     
def main():
    s = S()
    if 'A' in s and 'B' in s:
        print("Yes")
    else:
        print("No")


main()

Solution (Python):





A = input()

if A[0] == A[1] and A[1] == A[2]:
    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()
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):
def main():
    S = input()

    flag = False

    for i in range(1,len(S)):
        if(S[i] != S[i-1]):
            print('Yes')
            flag = True
            break

    if(not flag):
        print('No')

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()

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

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

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

for i in range(len(a)-1):
    if a[0]  != a[i+1]:
        print("Yes")
        break
    elif i == len(a)-2:
        print("No")

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

Solution (Python):
def main():
    S = input()
    if S[0] == S[1] and S[1] == S[2]:
        print('No')
        return
    print('Yes')
    
if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
S = input()

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

Solution (Python):
a = input()
count_A = 0
count_B = 0
for i in range(0,3):
    if a[i] == "A":
        count_A += 1
    if a[i] == "B":
        count_B += 1

if count_A == 3 or count_B == 3:
    print("No")
else:
    print("Yes")

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

cnta=0
cntb=0

for i in range(n):
    if s[i]=='A':
        cnta+=1
    else:
        cntb+=1

if cnta>0 and cntb>0:
    print('Yes')
else:
    print('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=="AAA" or s == "BBB":
    print("No")
else:
    print("Yes")

Solution (Python):
s=input()
a=['Yes','No']
print(a[s.count('A')==3 or s.count('B')==3])

Solution (Python):
if __name__ == '__main__':
    bus = [a.strip() for a in input()]
    if bus == ['B','B','B'] or bus == ['A','A','A']:
        print('No')
    else:
        print('Yes')

Solution (Python):
S = ''.join(set(input()))

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

Solution (Python):
n=input().split()
if n[0]=='AAA' or n[0]=='BBB':
    print('No')
else:
    print('Yes')

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