Problem:
 Score : 100 points    Problem Statement Snuke built an online judge to hold a programming contest.  When a program is submitted to the judge, the judge returns a verdict, which is a two-character string that appears in the string S as a contiguous substring.
(The judge can return any two-character substring of S .)  Determine whether the judge can return the string AC as the verdict to a program.      Constraints  2 \leq |S| \leq 5  S consists of uppercase English letters.         Input Input is given from Standard Input in the following format:  S       Output If the judge can return the string AC as a verdict to a program, print Yes ; if it cannot, print No .        Sample Input 1 BACD      Sample Output 1 Yes  The string AC appears in BACD as a contiguous substring (the second and third characters).       Sample Input 2 ABCD      Sample Output 2 No  Although the string ABCD contains both A and C (the first and third characters), the string AC does not appear in ABCD as a contiguous substring.       Sample Input 3 CABD      Sample Output 3 No       Sample Input 4 ACACA      Sample Output 4 Yes       Sample Input 5 XX      Sample Output 5 No

Solution (Python):
import sys

input = sys.stdin.buffer.readline
in_n = lambda: int(input())
in_nn = lambda: map(int, input().split())
in_s = lambda: input().rstrip().decode('utf-8')
in_map = lambda: [s == ord('.') for s in input() if s != ord('\n')]

MOD = 10**9 + 7
INF = 8 * 10**18


def main():

    S = in_s()
    if "AC" in S:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

Solution (Python):
S=input()

if S.find("AC")>-1:
  print("Yes")
else:
  print("No")

Solution (Python):
S = input()
f = 0
for i in range(len(S)-1):
  if S[i] == "A" and S[i+1] == "C":
    f = 1
    break
if f == 0:
  print("No")
else:
  print("Yes")

Solution (Python):
print("Yes" if input().count("AC") != 0 else "No")

Solution (Python):
s=input()

if s.count('AC')>=1:
  print('Yes')
else:
  print('No')

Solution (Python):
s = input()
p = False
for i in range(len(s)-1):
  if s[i:i+2] == 'AC': p = True
if p: print('Yes')
else: print('No')

Solution (Python):
print("Yes" if input().count("AC") >0 else "No")

Solution (Python):
print("Yes" if input().count("AC") >0 else "No")

Solution (Python):
N = list(input())
flag = 0
for i in range(0, len(N)):
    if N[i] == "C" and N[i - 1] == "A":
        flag = 1

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

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

Solution (Python):
S=input()
ans="No"
for i in range(len(S)):
    if "AC" == S[i:i+2]:
        ans="Yes"
        break
    
print(ans)

Solution (Python):


a=input()

c=[]
for i in a:
   c.append(i)



count=0
if "AC" in a :
    print("Yes")
else:
    print("No")

Solution (Python):
s=input()
n=len(s)
for i in range(n-1):
    if s[i]=="A" and s[i+1]=="C":
        print("Yes")
        exit()
print("No")

Solution (Python):
s = input()
if 'AC' in s:
    print('Yes')
else:
    print('No')

Solution (Python):
def main():
    s = input()
    if "AC" in s:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()

Solution (Python):

s=input()
flg=False
for i in range(len(s)-1):
    if s[i]=="A" and s[i+1]=="C":
        flg=True
if flg:
    print("Yes")
else:
    print("No")

Solution (Python):

import sys
def input():
    return sys.stdin.readline()[:-1]

def main():
    S = input()
    if 'AC' in S:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Solution (Python):
import sys

def I(): 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 main():
    s = input()
    for i in range(len(s)-1):
        ans = s[i]+s[i+1]
        if ans == 'AC':
            print('Yes')
            sys.exit()
    print('No')

if __name__ == '__main__':
    main()

Solution (Python):
print("Yes" if "AC" in input() else "No")

Solution (Python):

S=input()
if 'AC' in S:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
print('Yes' if 'AC' in s else 'No')

Solution (Python):
print('YNeos'['AC' not in input()::2])

Solution (Python):
S = input()
if "AC" in S:
	print('Yes')
else:
	print('No')

Solution (Python):
print("Yes" if input().count("AC") > 0 else "No")

Solution (Python):
S = input()
print('Yes' if 'AC' in S else 'No')

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

Solution (Python):
S = input ()
if 'AC' in S:
  print ('Yes')
else:
  print ('No')

Solution (Python):
print('Yes' if 'AC' in input() else 'No')

Solution (Python):
if input().count("AC")>=1:
    print("Yes")
else:
    print("No")

Solution (Python):
print('NYoe s'['AC'in input()::2])

Solution (Python):
S=input()
for i in range(len(S)-1):
    if (S[i]=="A")&(S[i+1]=="C"):
        print("Yes")
        break
else:
    print("No")

Solution (Python):
n = input()
if "A" in n and "C" == n[n.index("A")+1]:
  print("Yes")
else:
  print("No")

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

Solution (Python):
'''
Created on 2020/08/20

@author: harurun
'''
def main():
  import re
  import sys
  pin=sys.stdin.readline
  pout=sys.stdout.write
  perr=sys.stderr.write
  
  S=pin()[:-1]
  if re.fullmatch(r"[A-Z]*AC[A-Z]*",S)==None:
    print("No")
    return 
  print("Yes")
  return 

main()

Solution (Python):
S = input()
if "AC" in S:
    print("Yes")
else:
    print("No")

Solution (Python):
print('Yes' if 'AC' in input() else 'No')

Solution (Python):
S = input()
if 'AC' in S:
    print('Yes')
else:
    print('No')

Solution (Python):

s=input()
if "AC" in s:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
ans = 'Yes' if any(s[i:i + 2] == 'AC' for i in range(len(s) - 1)) else 'No'
print(ans)

Solution (Python):
s = list(input())
for i in range(len(s) - 1):
    if s[i] == "A" and s[i + 1] == "C":
        print("Yes")
        exit()
print("No")

Solution (Python):
def main():
    S = input()
    if 'AC' in S:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Solution (Python):
s = input()
flag = False
for i in range(len(s) - 1):
    if s[i:i + 2] == "AC":
        flag = True
        break
if flag == True:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
if 'AC' in s:
    print('Yes')
else:
    print('No')

Solution (Python):
if 'AC' in input():
  print('Yes')
else:
  print('No')

Solution (Python):
s = input()

if "AC" in s:
  print("Yes")
else :
  print("No")

Solution (Python):
s = input()

for i in range(len(s)-1):
    if s[i:i+2] == 'AC':
        print('Yes')
        exit()

print('No')

Solution (Python):
n = input()

for i in range(len(n)-1):
    if n[i:i+2] == 'AC':
        print('Yes')
        break
else:
    print('No')

Solution (Python):
import collections


def main():
    s = list(input())
    for i in range(len(s) - 1):
        if s[i] == 'A' and s[i + 1] == 'C':
            print('Yes')
            return
    print('No')


if __name__ == '__main__':
    main()

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

Solution (Python):
s = input()
print('Yes') if 'AC' in s else print('No')

Solution (Python):
print("YNeos"[not input().count("AC")::2])

Solution (Python):
a = input()
for i in range(len(a)-1):
    b = a[i:i+2]
    if b == "AC":
        print("Yes")
        exit()
print("No")

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    S = input().rstrip()

    if S.count("AC") > 0:
        ans = "Yes"
    else:
        ans = "No"

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
import sys
s = input()
for x, y in zip(s, s[1:]):
  if x == 'A' and y == 'C':
    print('Yes')
    sys.exit()
print('No')

Solution (Python):
def main():
    s=input()
    if(s.find('AC')!=-1):
        print('Yes')
    else:
        print('No')

main()

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

Solution (Python):
s = input()
flag = 0
for i in range(len(s) - 1):
    if s[i] == "A":
        if s[i + 1] == "C":
            flag = 1
if flag == 1:
    print("Yes")
else:
    print("No")

Solution (Python):
S=input()
print("Yes" if "AC" in S else "No")

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

Solution (Python):
s = input()
for i in range(len(s)-1):
    if s[i] == 'A' and s[i+1] == 'C':
        print('Yes')
        exit()
print('No')

Solution (Python):
s = input()

if s.count('AC'):
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()

if "AC" in s:
    print("Yes")
else:
    print("No")

Solution (Python):
print('Yes') if 'AC' in input() else print('No')

Solution (Python):
print('Yes' if 'AC' in input() else 'No')

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

Solution (Python):
s=str(input())
temp=0
for i in range(len(s)):
  if s[i]=="A" and i<=len(s)-2:
    if s[i+1]=="C":
      temp=1
if temp==1:
  print("Yes")
else:
  print("No")

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

Solution (Python):
S=input()
for i in range(len(S)-1):
  if S[i] == 'A' and S[i+1] == 'C':
    print('Yes')
    exit()
    
print('No')

Solution (Python):

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    s=input()
    if "AC" in s:
        print("Yes")
    else:
        print("No")

main()

Solution (Python):
s=input()

for i in range(len(s)-1):
    if s[i]+s[i+1]=="AC":
        print("Yes")
        exit()
print("No")

Solution (Python):
S = input()
print('Yes' if any([S[i:i+2] == 'AC' for i in range(len(S)-1)]) else 'No')

Solution (Python):
S=input()
print('Yes' if 'AC' in S else 'No')

Solution (Python):
s = input()
if 'AC' in s:
  print('Yes')
else:
  print('No')

Solution (Python):
s=input()
for i in range(len(s)):
  if s[i:i+2] =='AC':
    print("Yes")
    exit()
print("No")

Solution (Python):
S = input()
print("Yes" if sum([S[i:i+2]=="AC" for i in range(len(S))]) else "No")

Solution (Python):
s=input()
ans='No'
if s.count('AC')!=0:
  ans='Yes'
print(ans)

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

Solution (Python):
print("Yes" if "AC" in input() else "No")

Solution (Python):
def main():
    s = input()
    for i in range(len(s) - 1):
        if s[i:i + 2] == 'AC':
            print('Yes')
            exit()
    print('No')


if __name__ == '__main__':
    main()

Solution (Python):
S=input()
for i in range(1,len(S)):
  if "AC"==S[i-1]+S[i]:
    print("Yes")
    exit()
print("No")

Solution (Python):
print('Yes') if "AC" in input() else print("No")

Solution (Python):
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    S = SS()

    is_ok = False
    for i in range(len(S)):
        if S[i] == 'A' and S[i+1] == 'C':
            is_ok = True
            break

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

if __name__ == '__main__':
    resolve()

Solution (Python):
import re;print('YNeos'[not bool(re.fullmatch(r'.*AC.*',input()))::2])

Solution (Python):
print("YNeos"["AC" not in input().strip()::2])

Solution (Python):
s=input()

if 'AC' in s:
    print('Yes')

else:
    print('No')

Solution (Python):
print("YNeos"[input().find("AC")==-1::2])

Solution (Python):
s = input()
if 'AC' in s:
  print('Yes')
else:
  print('No')

Solution (Python):
S = input()
if 'AC' in S:
  print("Yes")
else:
  print("No")

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

for i in range(len(s)):
    if i+1 < len(s):
        if s[i]+s[i+1] == 'AC':
            print('Yes')
            exit()
print('No')

Solution (Python):
s = input()
print("Yes" if any([s[i:i + 2] == "AC" for i in range(len(s) - 1)]) else "No")

Solution (Python):
print("Yes" if "AC" in input() else "No")

Solution (Python):
if (input().count("AC")):
  print("Yes")
else:
  print("No")

Solution (Python):
print("Yes" if input().count("AC")>=1 else "No")

Solution (Python):
S = input()
print("Yes" if "AC" in S else "No")

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10**9 + 7


S = input()

for i in range(len(S)-1):
	if S[i] == "A" and S[i+1] == "C":
		print("Yes")
		break
else:
	print("No")

Solution (Python):
print('Yes') if 'AC' in input() else print('No')

Solution (Python):
if input().count("AC"):
  print("Yes")
else:
  print("No")

Solution (Python):
import re

def pattern_match(s):
    pattern = re.compile('AC')
    return re.search(pattern, s)

if pattern_match(input()):
    print('Yes')
else:
    print('No')

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

Solution (Python):
import sys
def S(): return sys.stdin.readline().rstrip()
S = S()
print('Yes' if 'AC' in S else 'No')

Solution (Python):
def main():
    S = input()
    if "AC" in S:
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    main()

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

for i in range(len(s) - 1):
    if 'A' == s[i]:
        if 'C' == s[i + 1]:
            print('Yes')
            exit(0)

print('No')

Solution (Python):
if "AC" in input():
  print("Yes")
else:
  print("No")

Solution (Python):
s = input()
if 'AC' in s:
  print('Yes')
else:
  print('No')

Solution (Python):
if('AC' in input()):
    print('Yes')
else:
    print('No')

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

Solution (Python):
print('YNeos'['AC'not in input()::2])

Solution (Python):
s = input()

for i in range(len(s)-1):
    if s[i] == "A" and s[i+1] == "C":
        print("Yes")
        exit()
print("No")

Solution (Python):
print('Yes' if 'AC' in input() else 'No')

Solution (Python):
import sys

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


def resolve():
    s = input()
    print("Yes" if "AC" in s else "No")


if __name__ == '__main__':
    resolve()

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

if S.count("AC")!=0:
  print("Yes")
else:
  print("No")

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

Solution (Python):
s = input()
if 'AC' in s:
  print('Yes')
else:
  print('No')

Solution (Python):
s = input() 
if 'AC' in s: 
    print('Yes') 
else: 
	print('No')

Solution (Python):
s=input()
for i in range(len(s)-1):
    if s[i]=="A" and s[i+1]=="C":
        print("Yes")
        exit()
print("No")

Solution (Python):
s= input()
if 'AC' in s:
  print('Yes')
else:
  print('No')

Solution (Python):
S = input()
for i in range(len(S)-1):
  if S[i:i+2] == 'AC':
    print('Yes')
    exit()
print('No')

Solution (Python):
s = input()
for i in range(len(s)-1):
    if s[i] == 'A' and s[i+1] == 'C':
        print('Yes')
        exit()
print('No')

Solution (Python):

import collections
import itertools as it
import math

 
s  = input()







print('Yes' if 'AC' in s else 'No')

Solution (Python):
S = input()
if 'AC' in S: print('Yes')
else: print('No')

Solution (Python):
S=input()
if 'AC' in S :
    print('Yes')
else :
    print('No')

Solution (Python):
S=input()
if 'AC' in S :
    print('Yes')
else :
    print('No')

Solution (Python):
S = input()

if "AC" in S:
    print("Yes")
else:
    print("No")

Solution (Python):
S=input()
print("Yes" if "AC" in S else "No")

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

Solution (Python):
S = input()

for i in range(len(S)):
    if S[i] == 'A' and S[i+1]=='C':
        print('Yes')
        exit()

print('No')

Solution (Python):
print('Yes'if'AC'in input()else'No')

Solution (Python):



s = input()

if s.count("AC"):
  print("Yes")
else:
  print("No")

Solution (Python):


import sys
input= lambda: sys.stdin.readline().rstrip()
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))

def resolve():
    S=input()
    for i in range(len(S)-1):
        if S[i]=="A" and S[i+1]=="C":
            print("Yes")
            break
    else:print("No")

resolve()

Solution (Python):
import itertools
import sys

s = input()
ok = False
for i in range(len(s) - 1):
    if (s[i] == 'A' and s[i + 1] == 'C'):
        ok = True

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

Solution (Python):
def main():
    S = input()
    if S.count("AC"):
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    s=input()
    if s.count('AC')>=1:
        print('Yes')
    else:
        print('No')
resolve()

Solution (Python):
S = input()
N = len(S)
for i in range (N-1):
  if(S[i]=='A' and S[i+1]=='C'):
    print("Yes")
    exit()
print("No")

Solution (Python):
def resolve():
  s = input()
  if 'AC' in s:
    print('Yes')
  else:
    print('No')
  return

if __name__ == "__main__":
  resolve()

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

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

s = input().rstrip()

if "AC" in s:
    print("Yes")
else:
    print("No")

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

Solution (Python):
s = str(input())
if s.count('AC'):
    print('Yes')
else:
    print('No')

Solution (Python):
S = input()
if S.count('AC') >= 1:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys
input = sys.stdin.readline
from collections import *

S = input()[:-1]

if 'AC' in S:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 9)
MOD = 10 ** 9 + 7

s = str(input())

if 'AC' in s:
    print ('Yes')
else:
    print ('No')

Solution (Python):
print('Yes' if input().count('AC') else 'No')

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

Solution (Python):
S = input()

if "AC" in S:
    print("Yes")
else:
    print("No")

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

Solution (Python):
S = input()
if S.count('AC') >= 1:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
p = s[0]
for i in s[1:]:
  if p+i == 'AC':
    print('Yes')
    exit()
  p = i
print('No')

Solution (Python):

import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    s=input()
    if s.count('AC')>=1:
        print('Yes')
    else:
        print('No')
resolve()

Solution (Python):

import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    s=input()
    ans='No'
    for i in range(len(s)-1):
        if s[i]=='A' and s[i+1]=='C':
            ans='Yes'
    print(ans)
resolve()

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

def resolve():
    
    s=str(input())
    ans='No'
    for i in range(len(s)-1):
        if s[i:i+2]=='AC':
            ans='Yes'
    print(ans)
    
    
resolve()

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

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    s=input()
    for i in range(len(s)-1):
        if s[i:i+2]=="AC":
            print("Yes")
            break
    else:print("No")

if __name__=='__main__':
    main()

Solution (Python):
s=input()
yn=0
for i in range(len(s)-1):
    if s[i:i+2]=="AC":
        yn=1
        break
if yn==1:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
if 'AC' in s:
    print('Yes')
else:
    print('No')

Solution (Python):
s = list(str(input()))
a = 0

for i in range(len(s)-1):
    if s[i] == 'A' and s[i+1] == 'C':
        a += 1
    else:
        a += 0
if a>= 1:
    print('Yes')
else:
    print('No')

Solution (Python):
print('Yes' if 'AC' in input() else 'No')

Solution (Python):
s=input()
if 'AC' in s:
    print('Yes')
else:
    print('No')

Solution (Python):
s = input()
flg = False
for i in range(1, len(s)):
  if s[i-1] == 'A' and s[i] == 'C':
    flg = True
    break
if flg:
  print('Yes')
else:
  print('No')

Solution (Python):
S = input()
N = len(S)

for i in range(N - 1):
    if S[i : i + 2] == "AC":
        print("Yes")
        break
else:
    print("No")

Solution (Python):
s = input()
if 'AC' in s:
  print('Yes')
else:
  print('No')

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    s=input()
    ans='No'
    for i in range(len(s)-1):
        if s[i]=='A' and s[i+1]=='C':
            ans='Yes'
            break
    print(ans)
resolve()

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


if 'AC' in input():
	print('Yes')
else:
	print('No')

Solution (Python):
S = input()
if 'AC' in S:
  print('Yes')
else:
  print('No')

Solution (Python):
print("Yes" if "AC" in input() else "No")

Solution (Python):
s=input()
n=len(s)
p=s[0]
for i in range(1,n):
    if s[i]=='C' and p =='A':
        print('Yes')
        exit(0)
    p = s[i]

print('No')

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

Solution (Python):
S=input()
print('Yes' if 'AC' in S else 'No')

Solution (Python):
s = input()
c = 0

for i in range(len(s)):
  if s[i] == 'A':
    if s[i+1] == 'C':
      c += 1
      break

if c > 0:
  print('Yes')
else:
  print('No')

Solution (Python):
print('YNeos'['AC'not in input()::2])

Solution (Python):
s=input()
ans=int()
for i in range(len(s)):
    if (s[i-1]=='A')&(s[i]=='C'):
        ans+=1
print('YNeos'[ans==0::2])

Solution (Python):
S = input()
print("YNeos"[not "AC" in S::2])

Solution (Python):
import re

s = input()
if re.match(".*AC.*", s):
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
target = "AC"
if target in s:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

s = read().rstrip().decode()
print('Yes' if 'AC' in s else 'No')

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    

    
    

    s = input().rstrip()
    if 'AC' in s:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

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

Solution (Python):
s = input()
flag1 = "ng"
flag2 = "ng"
for i in s:
    if flag1 == "ok":
      if i == "C":
        flag2 = "ok"
        break
    if i == "A":
      flag1 = "ok"
    else:
      flag1 = "ng"

if flag2 == "ng":
  print("No")
else:
  print("Yes")

Solution (Python):
s = input()
for i in range(len(s) - 1):
  if s[i:i+2] == 'AC':
    print("Yes")
    exit()
print("No")

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

Solution (Python):
s = input() 

if 'AC' in s:
    print('Yes')
else:
    print('No')

Solution (Python):
S = input()

if 'AC' in S:
    print('Yes')
else:
    print('No')

Solution (Python):
print(["No","Yes"]["AC" in input()])

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    s=input()
    for i in range(len(s)-1):
        if s[i:i+2]=="AC":
            print("Yes")
            break
    else:print("No")

if __name__=='__main__':
    main()

Solution (Python):
s = input()
y = 0
for i in range(len(s)-1):
    if s[i:i+2] == "AC":
        y = 1
if y == 1:
    print("Yes")
else:
    print("No")

Solution (Python):
S=input()

if "AC" in S:
  print("Yes")
else:
  print("No")

Solution (Python):
l = input()
for i in range(len(l)-1):
  if l[i:i+2] == "AC":
    print("Yes")
    break
else:
  print("No")

Solution (Python):
S = input()
if "AC" in S: print("Yes")
else: print("No")

Solution (Python):
s = input()
ans = "No"
for i in range(len(s)-1):
    if s[i:i+2] == "AC":
        ans = "Yes"
        break
print(ans)

Solution (Python):
S = input()
flg=False
for i in range(len(S)-1):
    if S[i:i+2]=='AC':
        flg=True
        break
ans='Yes' if flg else 'No'
print(ans)

Solution (Python):
if "AC" in input():
  print("Yes")
else:
  print("No")

Solution (Python):
S = input()
for i in range(len(S) - 1):
    if S[i] == "A":
        if S[i + 1] == "C":
            print("Yes")
            exit()
print("No")

Solution (Python):
S = input()
if 'AC' in S:
    print('Yes')
else:
    print('No')

Solution (Python):
S = input()
if "AC" in S:
    print("Yes")
else:
    print("No")

Solution (Python):
s = list(input())
for i in range(len(s)):
    if s[i] == "A":
        if s[i + 1] == "C":
            print("Yes")
            exit()
print("No")

Solution (Python):
s=input()
if(s.find('AC')!=-1):
    print("Yes")
else:
    print("No")

Solution (Python):
S=str(input())
if 'AC' in S:
    print('Yes')
else:
    print('No')

Solution (Python):

s = input()
print('Yes' if 'AC' in s else 'No')

Solution (Python):
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

def lcm(x, y):
    return (x * y) // math.gcd(x, y)

if __name__ == '__main__':
    s =input()
    if  "AC" in s:
        print("Yes")
    else:
        print("No")

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def S(): return input().rstrip()
def LS(): return S().split()
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = 1e10


def solve():
    s = S()
    if "AC" in s:
        print("Yes")
    else:
        print("No")
    return



if __name__ == '__main__':
    solve()

Solution (Python):
s = input()
print('Yes' if 'AC' in s else 'No')

Solution (Python):
s=input()
ans="No"
for a in range(len(s)-1):
  if s[a]=="A" and s[a+1]=="C":
    ans="Yes"
print(ans)

Solution (Python):
s = input()
if 'AC' in s:
    print('Yes')
else:
    print('No')

Solution (Python):
s=input()
if 'AC' in s:
    print('Yes')
else:
    print('No')

Solution (Python):

S = input()
if "AC" in S:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()

if "AC" in s:
    print("Yes")
else:
    print("No")

Solution (Python):
S = input()

for i in range(len(S)-1) :
    if S[i:i+2] == "AC" :
        print("Yes")
        exit()

print("No")

Solution (Python):
S = input()
f = False
for i in range(S.__len__()-1):
    f |= S[i:i+2] == "AC"

print("Yes" if f else "No")

Solution (Python):
S = input()


ans =0
for i in range((len(S)-1)):
  if (S[i] == "A") and (S[i+1] =="C"):
    ans = 1
if ans == 1:
  print("Yes")
else:
  print("No")

Solution (Python):
S = input()
print('Yes' if 'AC' in S else 'No')

Solution (Python):
s = input()
if 'AC' in s:
    print('Yes')
else:
    print('No')

Solution (Python):
S = input()
if 'AC' in S:
    print('Yes')
else:
    print('No')

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

Solution (Python):
l = input()

if "AC" in l:
  print("Yes")
else:
  print("No")

Solution (Python):
def main():
    print("Yes" if "AC" in input() else "No")


if __name__ == '__main__':
    main()

Solution (Python):
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

S = sr()
bl = False
for x, y in zip(S, S[1:]):
    if x+y == 'AC':
        bl = True

print('Yes' if bl else 'No')

Solution (Python):
s = input()

if "AC" in s:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()

if "AC" in s:
    ans = "Yes"
else:
    ans = "No"

print(ans)

Solution (Python):



S = input()


is_ok = False


for i in range(len(S)-1):
    if S[i]=='A' and S[i+1]=='C':
        is_ok = True
        break

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

Solution (Python):
x=input()
x=list(x)
t=0
for i in range(len(x)-1):
	if x[i]=='A' and x[i+1]=='C':
		print('Yes')
		t=1
		break
if t==0:
	print('No')

Solution (Python):
if input().find("AC")!=-1:print("Yes")
else:print("No")

Solution (Python):
print('Yes' if 'AC' in input() else 'No')

Solution (Python):
def main():
    s = input().rstrip()
    f = False
    for i in range(len(s)-1):
        if s[i] == "A" and s[i+1] == "C":
            f = True
    if f:
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    main()

Solution (Python):









import sys



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

def main():
    s = input()
    for i in range(len(s)-1):
        if s[i:i+2] == "AC":
            print('Yes')
            sys.exit()
    print('No')

if __name__ == '__main__':
    main()

Solution (Python):
S=input()
flag=0
for i in range(len(S)-1):
    
    if S[i:i+2]=="AC":
        print("Yes")
        flag=1
        break
if flag==0:
    print ("No")

Solution (Python):
print('Yes' if 'AC' in input() else 'No')

Solution (Python):
s = input()
for i in range(len(s)-1):
  if s[i:i+2] == "AC":
    print("Yes")
    break
else:
  print("No")

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

for i in range(n - 1):
	if s[i:i + 2] == 'AC':
		print('Yes')
		break
	elif i == n - 2:
		print('No')

Solution (Python):
s=input()
print('Yes' if 'AC' in s else 'No')

Solution (Python):
print('NYoe s'['AC' in input()::2])

Solution (Python):
s=input()
s_len=len(s)
ans="No"
for i in range(s_len-1):
    if s[i:i+2]=="AC":
        ans="Yes"
        break
print(ans)

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

Solution (Python):
if "AC" in input(): print("Yes")
else:   print("No")