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.



Sample input:
ABA


Sample output:
Yes

Submission status: Accepted

Solution code:
n=input()
if n=='AAA' or n=='BBB':
    print('No')
else:
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
a = [str(i) for i in s]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

a = input()

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

Submission status: Accepted

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

Submission status: Accepted

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


if a == b == c:
    ans = 'No'
else:
    ans = 'Yes'

print(ans)

Submission status: Accepted

Solution code:
S = list(input())

flag = 1

if S[0] == S[1] and S[1] == S[2]:
    flag = 0

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
st1, st2, st3 = input()
ans = "Yes"

if st1 == st2 == st3 :
    ans = "No"

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#test

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

Submission status: Accepted

Solution code:
S = input()
a = S.count("A")

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

Submission status: Accepted

Solution code:
s = input()
if s[0] == s[1] ==s[2] == "B" or s[0] == s[1] ==s[2] == "A":
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
tList = list(S)

firstStation = tList[0]
Monopoly = 0

for str in tList:
    if(str == firstStation):
        Monopoly = 0

    else:
        Monopoly = 1
        break

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
ret = "Yes"
if s == "AAA" or s == "BBB":
    ret = "No"
print("{}".format(ret))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
#T = int(stdin.readline())
S = stdin.readline().strip()

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

Submission status: Accepted

Solution code:
S = input()
a = []
for i in range(0, 3):
    a.append(S[i])

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

Submission status: Accepted

Solution code:
S = set(list(input()))
print('Yes' if "A" in S and "B" in S else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
_string = input()

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

Submission status: Accepted

Solution code:
sta = input()

s1 = sta[0]
s2 = sta[1]
s3 = sta[2]

if s1 == s2 and s2 == s3:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
s=input().strip()
s=sorted(s)
if s[0]==s[2]:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = [x for x in input()]
if 'A' in S and 'B' in S:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys
from math import *
from collections import deque, Counter, defaultdict
from fractions import gcd
input = lambda: sys.stdin.readline().rstrip()

def eprint(s):
    sys.stderr.write('DEBUG: {}'.format(s))
    return

def main():
    ans="Yes"
    S = input()
    if(S=='AAA' or S=='BBB'):
      ans="No"
    print(ans)
    return

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
bus = input()
if not( 'A' in bus):
  print( 'No')
elif not( 'B' in bus):
  print( 'No' )
else:
  print( 'Yes' )

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
cnt = 0
for i in range(3):
  if S[i] == 'A':
    cnt = cnt +1
 
if cnt == 3 or cnt == 0:
  print('No')
else:
  print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input_line=set(input())

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
#coding:utf-8
import sys,os
from collections import defaultdict, deque
from fractions import gcd
from math import ceil, floor
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = (lambda *something: print(*something)) if 'TERM_PROGRAM' in os.environ else lambda *x: 0
def main(given=sys.stdin.readline):
    input = lambda: given().rstrip()
    LMIIS = lambda: list(map(int,input().split()))
    II = lambda: int(input())
    XLMIIS = lambda x: [LMIIS() for _ in range(x)]
    YN = lambda c : print('Yes') if c else print('No')
    MOD = 10**9+7

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# coding: utf-8
 
 
def main():
 
    in_ = input()
 
    if (in_ == 'AAA' or
        in_ == 'BBB'):
        print('No')
    else:
        print('Yes')
 
    return 0
 
 
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = input()

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

else:
  print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()
if set(list(S)).__len__()==1:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()

if len(N)==3 and N.count('A')==2 or N.count('B')==2:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
s = input()
a = 'AAA'
b = 'BBB'
if a in s or b in s:
    print("No")
    exit()
print("Yes")

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**9)
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

s = ns()
ss = list(s)
a = 'No' if ss[0] == ss[1] and ss[1] == ss[2] else 'Yes'
print(a)

Submission status: Accepted

Solution code:
s = input()
if (s == "AAA") or ( s == "BBB"):
  print("No")

else:
  print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=input()
s=0
for i in range(3):
  s=s+ord(x[i])

if s==195 or s==198:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
x = input()

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

Submission status: Accepted

Solution code:
s= input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

s = sys.stdin.readline().strip()

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

Submission status: Accepted

Solution code:
S=input()
list=[]
ans=['*', '*', '*']
for s in S:list+="*" if s==S[0] else s

if list==ans :
    print('No')
else :
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
if len(s)==1:
    print('No')
else:
    if s.count('BA')>=1 or s.count('AB')>=1:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
A=input()
if 'B' in A:
	if 'A' in A:
		print('Yes')
	else:
		print('No')
else:
	print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    S = input()
    if S=='AAA' or S=='BBB':
        print('No')
        return
    print('Yes')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(input())
a = set(a)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter
a=list(input())
d=Counter(a).most_common()
if len(d)==2:
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
a=input()
c=0
c=a.count("AB")+a.count("BA")
if c==0:
    print("No")
else :
    print("Yes")

Submission status: Accepted

Solution code:
s = input()
if s.count(s[0]) == 3:
	print("No")
else:
	print("Yes" )

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
# coding: utf-8

s=str(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

S = read().rstrip()
print('Yes' if len(set(S)) == 2 else 'No')

Submission status: Accepted

Solution code:
import sys
from fractions import gcd
from itertools import groupby as gb
from itertools import permutations as perm
from itertools import combinations as comb
from collections import Counter as C
from collections import defaultdict as dd
sys.setrecursionlimit(10**5)
def y(f):
    if f:
        print('Yes')
    else:
        print('No')
def Y(f):
    if f:
        print('YES')
    else:
        print('NO')
def Z(f):
    if f:
        print('Yay!')
    else:
        print(':(')
def ispow(n):
    if int(n**.5)**2==n:
        return True
    return False

y(len(set(list(input())))==2)

Submission status: Accepted

Solution code:
str = input()
if str.count('A') == 3 or str.count('A') == 0:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
S = input()
before = S[0]
n = 0

for s in S:
    if before == s:
        n += 1

if n == 3:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
s =input()
if s == "AAA":
    print("No")
elif s == "BBB":
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
S = input()

char_list = list(S)


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

Submission status: Accepted

Solution code:
S = input() #ここで標準入力

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

Submission status: Accepted

Solution code:
S = input()
n = len(S)
if n == 3:
  a = S.split()
  x = S[0]
  y = S[1]
  z = S[2]
  if x != y or y != z:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

s = list(input())
#print(s)
count = 0

s = set(s)

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

Submission status: Accepted

Solution code:
S = list(str(input()))
flgA = 0
flgB = 0
for i in range(3):
    if S[i] == 'A':
        flgA = 1
    elif S[i] == 'B':
        flgB =1

if flgA == 1 and flgB ==1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
s = input()
print("No" if s == "AAA" or s == "BBB" else "Yes")

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = str(input())

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

Submission status: Accepted

Solution code:
S = input()

v = S[0]

T = "No"

if v != S[1] or v != S[2]:
  T = "Yes"
print(T)

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
S = input()

sl = [s for s in S]

def main():
    cnta = sl.count('A')
    cntb = sl.count('B')
    if cnta in (0,3) or cntb in (0,3):
        return 'No'
    else:
        return 'Yes'

print(main())

Submission status: Accepted

Solution code:
list = str(input())

if list == 'AAA' or list == 'BBB' or len(list) != 3:
    print("No")
else : 
    print("Yes")

Submission status: Accepted

Solution code:
s = list(input())
if s.count("A") != len(s) and s.count("B") != len(s): print("Yes")
else: print("No")

Submission status: Accepted

Solution code:
#文字列の入力
S = input()

#文字列の判定
if (S == "AAA" or S == "BBB"):
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
##158
##A
S = str(input())
if S == "BBB":
    print("No")
elif S == "AAA":
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
s = input()
if (s.find("A") != -1) and (s.find("B") != -1):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
S = input()

answer = "No"

if not (S[0] == S[1] and S[1] == S[2] and S[0] == S[2]):
    answer = "Yes"

print(answer)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
s=input()

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

Submission status: Accepted

Solution code:
S=input()
L=[S[0],S[1],S[2]]
SS=set(L)
ans=len(SS)
if ans==2:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
s = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
S=list(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

str = input()

answer = "No"
if 'B' in str and 'A' in str:
  answer = "Yes"
  
print(answer)

Submission status: Accepted

Solution code:
# coding: utf-8
s = input()
if 'AB' in s or 'BA' in s:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
tmp = ""

for s in list(input()):
    if tmp == "":
        tmp = s
        continue
    if tmp != s:
        print("Yes")
        exit()

print("No")

Submission status: Accepted

Solution code:
s = input()

x = set(s)
if len(x) ==1:
  print("No")
elif len(x) ==2:
  print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
 
 
def main():
 
    in_data = input()
 
    if (in_data == 'AAA' or
        in_data == 'BBB'):
        print('No')
    else:
        print('Yes')
 
    return 0
 
 
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sun Jan 19 20:52:57 2020

@author: over-
"""


S=input()

ans='No'

if S!='AAA' and S!='BBB': ans='Yes'

print(ans)

Submission status: Accepted

Solution code:
S = str(input())

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

Submission status: Accepted

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

print("Yes" if len(s)>1 else "No")

Submission status: Accepted

Solution code:
a = list(input())
A_flag = False
B_flag = False

for n in range(3) :
    if a[n] == "A":
        A_flag = True
    elif a[n] == "B":
        B_flag = True
if A_flag and B_flag:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s = [i for i in input()]
if len(set(s)) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
n = input()
if n=="AAA":
    print("No")
elif n=="BBB":
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-

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


if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
def main():
    s = input()
    exists = s != "AAA" and s != "BBB"
    return "Yes" if exists else "No"
    


if __name__ == "__main__":
    print(main())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
SSS = input()
KKK = "No"
NNN = []
NNN = list(SSS)
if NNN[0] != NNN[1] or NNN[0] != NNN[2]:
    KKK = "Yes"
print(KKK)

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
S = input()
if S == "AAA" or S == "BBB":
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
from operator import mul
from functools import reduce
import pprint
sys.setrecursionlimit(10 ** 9)


INF = 10 ** 20
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 1000000007

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

Submission status: Accepted

Solution code:
S = input()
if len(set(S)) == 1:
    print('No')
elif len(set(S)) == 2:
    print('Yes')
else:
    print('???')

Submission status: Accepted

Solution code:
S=input()
print(("No","Yes")[len(set(S))>1])

Submission status: Accepted

Solution code:
S=str(input())

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

Submission status: Accepted

Solution code:
A = input()

if A in ['AAA', 'BBB']:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
S = str(input())

c = S[0]
d = S[1]
e = S[2]

if c == d == e:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inp=input()
if inp=='AAA':
    print("No")
elif inp=='BBB':
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
# A - Station and Bus
s = input()

cntA = 0
cntB = 0

for i in s:
    if i == 'A':
        cntA += 1

    else:
        cntB += 1

if cntA == 3 or cntB == 3:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
s=input()
if s=='AAA':
  print('No')
  exit()
if s=='BBB':
  print('No')
  exit()
else:
  print('Yes')
  exit()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys

YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(S: str):
    if S=='AAA' or S=='BBB':
        print('No')
    else:
        print('Yes')
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    solve(S)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
1.
S = input()

if len(S)==3 and S.count('A')==2 or S.count('B')==2:
    print('Yes')

else:
    print('No')

Submission status: Accepted

Solution code:
N = input()
l = list(N)
if(l[0]==l[1]):
    if(l[1]==l[2]):
        print("No")
    else:
        print("Yes")
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding:utf8
# 文字の設定
a,b,c=input()
# 条件
if a==b==c :
    print("No")
else :
    print("Yes")

Submission status: Accepted

Solution code:
def solve():
    N = input()
    
    if not 'A' in N or not 'B' in N:
        return 'No'

    return 'Yes'

print(solve())

Submission status: Accepted

Solution code:
s=input().strip()
if "A" not in s:
    print("No")
elif "B" not in s:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
import sys

s = list(input())
if s[0] == 'A' and s[1] == 'A' and s[2] == 'A':
  print('No')
  sys.exit()
if s[0] == 'B' and s[1] == 'B' and s[2] == 'B':
  print('No')
  sys.exit()
print('Yes')

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections
S = input()


c = collections.Counter(list(S))

if len(c.keys()) >= 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
S_list = list(input())


a_flg = 0
b_flg = 0
i = 0
while i < 3:
  if (S_list[i] == "A"):
    a_flg = 1
  else:
    b_flg = 1
  i += 1

if (a_flg == 1 and b_flg ==1):
  print("Yes")
else:
  print("No")
#