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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=raw_input()
if s[0]==s[1] and s[0]!=s[2]:
  print "Yes"
elif s[0]==s[2] and s[0]!=s[1]:
  print "Yes"
elif s[1]==s[2] and s[1]!=s[0]:
  print "Yes"
elif s[1]==s[0] and s[1]!= s[2]:
  print "Yes"
elif s[2]==s[0] and s[2]!= s[1]:
  print "Yes"
elif s[2]==s[1] and s[2]!= s[0]:
  print "Yes"
else:
  print "No"

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

if __name__ == "__main__":
    S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

if S[0] == S[1] == S[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=list(input())
if S[0]==S[1]==S[2]:
    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:
a, b, c = map(str, input())
S = a + b + c
if a == b == c:
    print('No')
else:
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
print('YNeos'[len(set(input()))%2::2])

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

if S.count("A") >= 1 and S.count("B") >= 1 :
    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:
print('Yes' if len(set(input())) == 2 else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
station = input()

if station[0] == station[1] and station[1] == station[2]:
    print("No")
elif station[0] == station[1] and station[1] != station[2]:
    print("Yes")
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:
n=input()
a=0
for i in n:
    if i=="A":
        a+=1
if a%3!=0:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
B = input()
if B[0]==B[1]==B[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()
if s[0] == s[1] and s[1] == s[2]:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
# ABC 158: A – Station and Bus
s = input()
print('Yes' if 'AB' in s or 'BA' in s else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    S = input()
    ans = "Yes" if "A" in S and "B" in S else "No"

    print(ans)


if __name__ == "__main__":
    main()

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

bool1 = S[0] == S[1]
bool2 = S[1] == S[2]
bool3 = S[2] == S[0]

if bool1*bool2*bool3:
  print('No')
else:
  print('Yes')

Submission status: Accepted

Solution code:
#!/usr/bin/python
# -*- coding: utf-8 -*-

# 入力はstringで入る．
# intにしたければ int(input())
# floatで受け取ると 1.0 になる．

# 入力 : S
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

X = sys.stdin.readline().rstrip()
if len(set(X)) > 1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
station = []
station = list(input())

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

Submission status: Accepted

Solution code:
li = list(str(input()))
judge = True
for i in range(len(li)-1):
    if li[i] != li[i+1]:
        judge = False
if judge == True:
    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().rstrip()
if s[0] == s[1] == s[2]:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
s = list(input())
s.append(s[0])
ans = False
for i in range(len(s)-1):
    if s[i] != s[i+1]:
        ans = True
if ans:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect
#pypyではscipy, numpyは使えない
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
#import numpy as np
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')

def main():
  s = input()
  if len(set(s)) == 2:
    print('Yes')
  else:
    print('No')
  
  
if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
print('YNeos'[2-len(set(input()))::2])

Submission status: Accepted

Solution code:
print(' YNeos'['AAA'!=input()!='BBB'::2])

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

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

Submission status: Accepted

Solution code:
from bisect import bisect_left as bl
from bisect import bisect_right as br
from heapq import heappush,heappop
import math
from collections import *
from functools import reduce,cmp_to_key
import sys
input = sys.stdin.readline

M = mod = 998244353
def factors(n):return sorted(set(reduce(list.__add__, ([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0))))
def inv_mod(n):return pow(n, mod - 2, mod)

def li():return [int(i) for i in input().rstrip('\n').split()]
def st():return input().rstrip('\n')
def val():return int(input().rstrip('\n'))
def li2():return [i for i in input().rstrip('\n')]
def li3():return [int(i) for i in input().rstrip('\n')]

print('Yes' if len(Counter(st())) > 1 else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
S= str(input())
a='Yes'
b='No'
if S[0] is  S[1] and S[1] is S[2]:
    print(b)
else:
    print(a)

Submission status: Accepted

Solution code:
S = input()

# S = 'ABA'

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import itertools
import fractions
def main():
  s = input()
  if s.count('A') == 3 or s.count('B') == 3:
    print('No')
  else:
    print('Yes')
  
if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
s = list(input())

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

Submission status: Accepted

Solution code:
S = list(input())
for i in range(len(S)):
  if (i == (len(S) - 1)):
    break
  if ( 'A' in (S[i] + S[i + 1]) and 'B' in (S[i] + S[i + 1]) ):
    print("Yes")
    exit()
print("No")

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
s = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())

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

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:
a=input()
num=1
for i in range(len(a)-1):
    if a[i]==a[i+1]:
        num+=1
if num==len(a):
    print("No")
else:
    print("Yes")

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
import sys

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

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

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:
n = list(set(e for e in input()))
print("Yes" if "A" in n and "B" in n else "No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve(string):
    return "No" if string in ["AAA", "BBB"] else "Yes"


if __name__ == '__main__':
    import sys
    print(solve(sys.stdin.read().strip()))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())

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

Submission status: Accepted

Solution code:
s=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:
n = input()
if n[0] ==n[1] and n[1] == n[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 = list(i for i in input())
 
if 'A' in S and 'B' in S:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
S = str(input())
flag = 0
for i in range(len(S)-1):
    if S[i]!=S[i+1]:
        flag = 1
if flag == 1:
    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 S[0]==S[1]==S[2]:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print ("No" if input() in ("AAA", "BBB") else "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()
a=s.count('A')
b=3-a
if(a==1 or b==1):
    print('Yes')
else:
    print('No')

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
s=input()
c=Counter(s)
if(len(c.keys())==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
# Your code here!

S = set(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
#--------------------------------------------
#ライブラリ呼び出し
import sys
import math
from math import sqrt
#--------------------------------------------

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

Submission status: Accepted

Solution code:
#--------------------------------------------
#ライブラリ呼び出し
import sys
import math
from math import sqrt
#--------------------------------------------

N = str(input())
if N == "AAA" or N == "BBB":
    print("No")
else:
    print("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:
#--------------------------------------------
#ライブラリ呼び出し
import sys
import math
from math import sqrt
#--------------------------------------------

N = str(input())
if N == "AAA":
    print("No")
elif N == "BBB":
    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()
 
if s == "AAA" or s == "BBB":
  print("No")
else:
  print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s = input()
if s == 'A'*3 or s == 'B'*3:
    print('No')
else:
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
S = input()

if (S.count("A") == 0)or(S.count("A") == 3):
  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:
s = input()
prev = s[0]
for i in s[1:]:
    if prev!=i:
        print("Yes")
        break
    prev = i
else:
    print("No")

Submission status: Accepted

Solution code:
s = input()

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

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:
print("No" if len(set(input())) == 1 else "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()
flag = False
for i in range(3):
    if S[i] != S[0]:
        flag = True

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())

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

Submission status: Accepted

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

#print(NS)
#print(len(set(NS)))

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
print("Yes") if len(set(input())) > 1 else print("No")

Submission status: Accepted

Solution code:
A=list(input())
A.sort()#sortメソッドは破壊的
print("No" if A[1]==A[2]==A[0] else "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 = str(input())
len(s)==3

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
    Author: _YL_
"""
#n, k = map(int, input().split())
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")

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

S = str(input())

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

print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
bus = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i = input()
if "A" in i and "B" in i:
  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()

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

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

Submission status: Accepted

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

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' or s == 'BBB':
  print ("No")
else:
  print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

print(stat)

Submission status: Accepted

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

if __name__ == "__main__":
  solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
# -*- coding: utf-8 -*-
"""
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(i)
print(bus(i))