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):
print("Yes" if input().count('AC') else "No")

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

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

Solution (Python):
S = input()

if S[0:2] == "AC" or S[1:3] == "AC" or S[2:4] == "AC" or S[3:5] == "AC" or S[4:6] == "AC":
  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()
l = []
for i in range(len(s)-1):
  l.append(s[i:i+2])
print("Yes" if "AC" in l else "No")

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

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

Solution (Python):
S = input()

for i,s in enumerate(S):
    if s == 'A':
        if i != len(S) and S[i+1] == 'C':
            print('Yes')
            break

else:
    print('No')

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

print(ans)

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'in input()::2])

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

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 = str(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):
import re

s = input()
m = re.search("AC",s)
if m:
  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")
        break
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):
print('Yes' if 'AC' in input() else 'No')

Solution (Python):
S = list(input())
ans = -1
for i in range(1, len(S)):
    if S[i - 1] == "A" and S[i] == "C":
        print("Yes")
        ans = 1
        break
if ans == -1:
    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 "AC" in input():
  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):
print("Yes" if input().find("AC")>=0 else "No")

Solution (Python):
from collections import defaultdict
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7

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

S = input()

for i in range(4):
	if S[i:i+2] == 'AC':
		print('Yes')
		sys.exit()

print('No')

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

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

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')
        exit()
print('No')

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

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

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

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

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

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

Solution (Python):
S = input().strip()
for k in range(len(S)-1):
  if S[k]+S[k+1] == 'AC':
    print('Yes')
    break
else:
  print('No')

Solution (Python):
print(("No", "Yes")[input().find("AC")>=0])

Solution (Python):





if __name__ == '__main__':
    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().rstrip()
if 'AC' in s:
  print('Yes')
else:
  print('No')

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

Solution (Python):
import math
import sys

def getinputdata():

    
    array_result = []
    
    data = input()

    
    array_result.append(data.split(" "))

    flg = 1

    try:


        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:


        return array_result





arr_data = getinputdata()

s = arr_data[0][0]


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

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

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

Solution (Python):
if("AC" in input()):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()
T=S.replace("AC","")
if len(S)==len(T):
  print("No")
else:
  print("Yes")

Solution (Python):
print(['No','Yes'][min(input().find('AC'),0)+1])

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):
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 raw_input().find("AC")>=0 else "No"

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

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

Solution (Python):


def f(s):
    return 'Yes' if (s.find('AC') != -1) else 'No'

def test():
    assert f('BACD') == 'Yes'
    assert f('ABCD') == 'No'
    assert f('CABD') == 'No'
    assert f('ACACA') == 'Yes'
    assert f('XX') == 'No'


def main():
    print(f(input()))


if __name__ == '__main__':
    main()

Solution (Python):
x=input()
y='AC'


if (y in x) ==True:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):

if __name__ == '__main__':
    S = raw_input()
    if 'AC' in S:
        print 'Yes'
    else:
        print 'No'

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

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

Solution (Python):

if __name__ == '__main__':
    S = raw_input()
    if 'AC' in S:
        print 'Yes'
    else:
        print 'No'

Solution (Python):



if __name__ == '__main__':
    S = raw_input()
    flg = True
    for index in range(len(S) - 1):
        if S[index]+S[index+1] == 'AC':
            print 'Yes'
            flg = False
            break
    if flg:
        print 'No'

Solution (Python):

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

Solution (Python):
s = input()
a = ''
for i in range(len(s)-1):  
  if s[i] + s[i+1] =='AC':
    a = 'Yes'
  else:
    pass

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

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

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

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

Solution (Python):
s=raw_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):
data = input()
print("Yes" if "AC" in [data[i:i+2] for i in range(len(data)-1)] else "No")

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

Solution (Python):
S = input()
f = False 
for i in range(len(S)-1):
    if S[i] == 'A'and S[i+1]=='C':
        f = True
        print("Yes")
        break;


if not f: 
    print("No")

Solution (Python):
S=input()
f=True
for i in range( len(S)-1 ):
    if S[i] == 'A' and S[i+1] == 'C':
        f = False
        

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

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

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

Solution (Python):
s=input()
import re
if re.search("AC",s):
    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=raw_input()
l=len(s)
ok=False
for i in range(0,l-1):
    if(s[i]=='A' and s[i+1]=='C'):
        ok=True
if(ok==True):
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
found = False
for i in range(len(s)-1):
    if s[i] == 'A' and s[i+1] == 'C':
        print('Yes')
        found = True
        break
if not found:
    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):
def main():
    if "AC" in input(): print("Yes")
    else: print("No")


if __name__ == "__main__":
    main()

Solution (Python):

import sys
S = input()
for tmp in range(len(S)-1):
    if S[tmp:tmp+2] == 'AC':
        print("Yes")
        sys.exit()
print("No")

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

Solution (Python):
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
INF = float("inf")


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


if __name__ == '__main__':
    main()

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

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

Solution (Python):


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

Solution (Python):
s = input()

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

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

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

Solution (Python):
S = input()

if S.find('AC') != -1:
    print('Yes')
else:
    print('No')

Solution (Python):
S=input()
i=0
p="No"
d=0
while i<len(S)-1 and d==0:
    if S[i]=="A" and S[i+1]=="C":
        d=1
    i+=1
if d==1:
    p="Yes"
print(p)

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

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

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

ch=0

for i in a:
    if ch==0 and i=="A":
        ch=1
    elif ch==1:
        if i=="C":
            ch=2
            break
        else:
            ch=0

if ch==2:
    print "Yes"
else:
    print "No"

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

Solution (Python):
from sys import stdin
a = stdin.readline().strip()
ans = 'No'
if 'AC' in a:
 ans = 'Yes'
print ans

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

Solution (Python):

s=input()

try:
    res=s.index("AC")
except:
    res=-1

if res>=0:
    print("Yes")
else:
    print("No")

Solution (Python):
ans=raw_input()
if ans.find('AC')!=-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):
words = input()
if 'AC' in words:
    print('Yes')
else:
    print('No')

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

else:
    print("No")

Solution (Python):
a = input()
list(a)
for i in range(len(a)):
    if a[i] != "A" and i != len(a)-1 :
        continue
    elif a[i] == "A" :
        if a[i+1] == "C" :
            print("Yes")
            break
    else :
        print("No")

Solution (Python):
S = input("")
Anum = S.find("A")
Cnum = S.find("C")

if Cnum == Anum + 1:
    print("Yes")
else:
    print("No")

Solution (Python):
a=input("");
flag=False;
for i in range(0,len(a)-1):
  if a[i]=='A' and a[i+1]=='C':
    flag=True;
if flag==True:
  print("Yes");
else:
  print("No");

Solution (Python):
print('Yes' if input().find('AC') >= 0 else 'No')

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

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

Solution (Python):
import sys

def func(S):
    for i in range(len(S)-1):
        if(S[i] == 'A' and S[i+1] == 'C'):
            print("Yes")
            sys.exit()
    print("No")
    sys.exit()

S = input()
func(S)

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

Solution (Python):
S = input()

x = 'No'
if S == 'AC':
    x = 'Yes'
    
for i in range(len(S)-2):
    s = S[i:i+2]
    if s == 'AC':
        x = 'Yes'
        break

print(x)

Solution (Python):



"""code-fes-2017-qual-c-a"""


import sys
import re


def main():
    """Main function."""
    S = input()

    print("Yes") if re.search("AC", S) else print("No")


if __name__ == '__main__':
    sys.exit(main())

Solution (Python):
print('Yes' if input().find('AC') >= 0 else 'No')

Solution (Python):
S = str(input())
Slist = list(S)
flag = False
for i in range(len(Slist)-1):
    st = Slist[i] + Slist[i+1]
    if(st == "AC" and flag == False):
        print('Yes')
        flag = True
if(flag == False):
    print('No')

Solution (Python):
import re
n = input()
if re.search("AC", n):
    print("Yes")
else:
    print("No")

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

Solution (Python):
def main():
	S = input()
	word = "AC"

	if word in S:
		print("Yes")
	else:
		print("No")
if __name__ == '__main__':
	main()

Solution (Python):
if __name__ == '__main__':
    S = input()
    if S.count("AC") > 0:
        print("Yes")
    else:
        print("No")

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

Solution (Python):
S = input()
print("Yes" * ("AC" in S) + "No" * ("AC" not in S))

Solution (Python):


s = list(input())

output = "No"
for i in range(len(s) - 1):
    if(s[i] == 'A'):
        if(s[i+1] == 'C'):
            output = "Yes"
            break

print(output)

Solution (Python):


data = input()

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

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

Solution (Python):
S = raw_input()

def check():
    for i in range(len(S) - 1):
        if S[i:i+2] == 'AC':
            return True
    return False

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

Solution (Python):
search_str = "AC"
cur_string = input()
str_len = len(cur_string)
str_list = []
for i in range(str_len-1):
    str_list.append(cur_string[i:i+2])
if search_str in str_list:
    print("Yes")
else:
    print("No")

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

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

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

Solution (Python):




"""








"""
def checker(target):
    if len(target.split("AC")) > 1:
        print("Yes")
    else:
        print("No")



if __name__ == '__main__':
    target = input()
    checker(target)

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

Solution (Python):
def A():
    S = input()
    for i in range(len(S)):
        if S[i:i+2] ==  "AC":
            return 1

    return 0

if __name__ == '__main__':
    result = A()
    if result == 1:
        print("Yes")
    else:
        print("No")

Solution (Python):
s = input()

if s.find("AC") >= 0:
    print("Yes")
else:
    print("No")

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


ans="No"
for i in range(len(S)-1):
	
	if S[i]+S[i+1]=="AC":
		ans="Yes"

print ans

Solution (Python):
a=input().rstrip()
l=len(a)
flag=False
for i in range(l-1):
    if(a[i:i+2]=="AC"):
        flag=True

print(("No" if flag==False else "Yes"),flush=True)

Solution (Python):
import re
s = input()
m = re.search('AC',s)
if m:
	print("Yes")
else:
	print("No")

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

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

Solution (Python):

def main():
    s = input()
    i = "AC" in s
    if i:
        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):




"""
Created on Mon Oct  9 22:12:40 2017

@author: kitagenbakurou
"""
import numpy as np
import copy

s = input()

flag = False
for i in range(len(s) - 1) : 
    if s[i:(i+2)] == "AC" : 
        flag = True
        break

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

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

flag = False
for i in range(length-1):
    if s[i] == 'A' and s[i+1] =='C':
        flag = True
        break
        
if flag:
    print("Yes")
else:
    print("No")

Solution (Python):
def is_contained_ac(s):
    for i in range(len(s)-1):
        if s[i:i+2] == "AC":
            return True
    return False

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

Solution (Python):

S = input()

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

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 'Yes' if 'AC' in raw_input() else 'No'

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

Solution (Python):



s = raw_input()

status = 0

for i in range(len(s)-1):
    if s[i:i+2] == "AC":
        status = 1

if status == 1:
    print "Yes"
else:
    print "No"

Solution (Python):
inputs = input()

x = list(inputs)

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

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

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

Solution (Python):
def main():
    S = input()

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

main()

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

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

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


if __name__ == '__main__':
  main()

Solution (Python):


s = input()

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

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

Solution (Python):

def inpl(): return tuple(map(int, input().split()))

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

Solution (Python):




S = input()

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

else:
	print("No")

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

Solution (Python):
a= input()
if a[0:2]=="AC" or a[1:3]=="AC" or a[2:4]=="AC" or a[3:5]=="AC":
  print("Yes")
else:
  print("No")

Solution (Python):
S = input()
try:
  if S.index('AC') != -1:
      print('Yes')
except:
    print('No')

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

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

print(ans)

Solution (Python):
import sys

print('Yes' if 'AC' in sys.stdin.readline() 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()
count = 0
for i in range(len(s)-1):
    if s[i:i+2] == "AC":
        count = 1
        break
if count == 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()
print('Yes' if 'AC' in s else 'No')

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

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

Solution (Python):



def rl(s): return xrange(len(s))

import sys
stdin = sys.stdin
def tokens(): return stdin.readline().strip().split()
def ints(): return map(int, tokens())
def int1(): return int( stdin.readline().strip() )

INF = 2147483647


S = tokens()[0]

if 'AC' in S:
    print "Yes"
else:
    print "No"

Solution (Python):
def ri(): return int(input())
def rli(): return list(map(int, input().split()))
def rls(): return list(input())
def pli(a): return "".join(list(map(str, a)))
def plis(a): return " ".join(list(map(str, a)))

S = input()
flag = False
for i in range(len(S)-1):
    if(S[i]+S[i+1] == "AC"): flag = True

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

Solution (Python):
S = input()

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

if flag:
    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')
		break
else:
	print('No')

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

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

Solution (Python):
a = raw_input()
if "AC" in a:
 print "Yes"
else:
 print "No"

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

Solution (Python):
a = raw_input()

if "AC" in a:
    print "Yes"

else:
    print "No"

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

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

Solution (Python):





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

if __name__ == "__main__": main()

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

Solution (Python):
print ['No', 'Yes']['AC' in raw_input()]

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

Solution (Python):
S = raw_input()
def test():
    for i in range(len(S)-1):
        if S[i:i+2] == "AC":
            return 1
    return 0

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

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

Solution (Python):

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

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

Solution (Python):


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


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

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

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

Solution (Python):
s = input()

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

Solution (Python):
inp=raw_input()
if "AC" in inp:print "Yes"
else:print "No"

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

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):
print "Yes" if "AC" in raw_input() else "No"

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

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**15
mod = 10**9+7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)


def main():
    s = S()
    l = len(s)
    for i in range(l-1):
        if s[i:i+2] == 'AC':
            return 'Yes'

    return 'No'


print(main())

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

Solution (Python):
s = input()

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

Solution (Python):
INF = 999999999999999999L
EPS = 1e-12

def read():
    return raw_input().strip()

def read_ints():
    return map(int,read().split())

s = read()
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()
if 'AC' in S:
    print("Yes")
else:
    print("No")

Solution (Python):
print('Yes' if 'AC' in input() else '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()
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):



import array
from bisect import *
from collections import *
import fractions
import heapq 
from itertools import *
import math
import re
import string

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

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

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

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

Solution (Python):















def main():
    s = input().strip()
    print("Yes" if s.find("AC") != -1 else "No")

main()

Solution (Python):
s = input()

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

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

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

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

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

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

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