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):
S = input()
print("YNeos"[S.find("AC")<0::2])

Solution (Python):
S = input()
ans = False
for i in range(len(S)-1):
    if S[i] + S[i+1] == 'AC':
        ans = True

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

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


import re
print("Yes") if len(re.findall(r"AC", input())) > 0 else print("No")

Solution (Python):
def main() -> None:
    S = input()
    print("Yes" if "AC" in [S[i:i+2] for i in range(len(S)-1)] else "No")


if __name__ == '__main__':
    main()

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

Solution (Python):
if input().count("AC")>0:
	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(0)
print("No")

Solution (Python):

import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

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

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

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

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

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

Solution (Python):
s = input()

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

print("No")

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

Solution (Python):
if "AC" in input():
  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")
        import sys
        sys.exit()
print("No")

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

Solution (Python):
import math
import decimal
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

class Library():
    @staticmethod
    def Swap(a,b):
        return [b,a]

    @staticmethod
    def myRound(a,dig=0): 
        p = 10 ** dig
        return (a * p * 2 + 1) // 2 / p

    @staticmethod
    def Roundup(a,dig=0): 
        if a < 0:
            return int(a)
        else:
            return int(a + 0.9)

    @staticmethod
    def Gcd(a,b): 
        if (a<b):
            a,b = Library.Swap(a,b)
        if (b==0):
            return a
        else:
            return Library.Gcd(b,a%b)

    @staticmethod
    def Lcm(a,b): 
        return a//Library.Gcd(a,b)*b

    @staticmethod
    def Divisors(a): 
        divisors = []
        for i in range(1,int(a**0.5)+1):
            if a%i==0:
                divisors.append(i)
                if i!=a//i:
                    divisors.append(a//i)
        divisors.sort()
        return divisors

class Prime():
    
    
    def __init__(self,num):
        self.num = num
        self.sieve = [0] * (self.num + 1)
        self.sieve[0] = -1
        self.sieve[1] = -1
        for i in range(2,self.num + 1):
            if not self.sieve[i]:
                self.sieve[i] = i
                for j in range(i * i,self.num + 1,i):
                    if self.sieve[j]:
                        self.sieve[j] = i
    
    
    def isPrime(self,num = None):
        if num is None:
            num = self.num
        if self.sieve[num] == num:
            return True
        else:
            return False
    
    
    def PrimeNum(self,num = None):
        if num is None:
            num = self.num
        prime = []
        for i in range(2,num):
            if self.sieve[i] == i:
                prime.append(i)
        return prime
    
    
    def PrimeFact(self,num = None):
        if num is None:
            num = self.num
        fact = []
        while self.sieve[num] != num:
            fact.append(self.sieve[num])
            num //= self.sieve[num]
        fact.append(num)
        return fact

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

if __name__=='__main__':
    main()

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

Solution (Python):
s=input()

if "AC" in s:
  print("Yes")
else:
  print("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()
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(' YNeos'['AC'in input()::2])

Solution (Python):


S = input()

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

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

Solution (Python):
import random
s=input()
ans="No"
for _ in range(1<<16):
  i=random.randrange(len(s)-1)
  if(s[i:i+2]=="AC"):
    ans="Yes"
print(ans)

Solution (Python):

 
import math
import itertools
import sys
import copy
 





S = str(input())

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

Solution (Python):
S = input()
print('Yes' if  'AC' in S or S[0]+S[-1] == 'AC' else '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 input() else 'No')

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

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

Solution (Python):
import re


def main(s: str):
    if re.match(r'.*AC.*', s):
        print('Yes')
    else:
        print('No')


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

    main(s)

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

Solution (Python):
s=input()
for i,j in zip(s[:-1],s[1:]):
  if i+j=="AC":
    print("Yes")
    exit()
print("No")

Solution (Python):
S=input()

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

Solution (Python):
from sys import stdin

s = stdin.readline().rstrip()

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

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

Solution (Python):
import sys
S = 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()
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().strip()
flag = 0
for i in range(len(S)-2+1):
    if S[i:i+2]=="AC":
        flag = 1
        break
if flag==1:
    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 = list(input())
for i in range(len(S)-1):    
    if S[i] == "A" and S[i+1] == "C":
        print("Yes")
        import sys
        sys.exit()
print("No")

Solution (Python):
import sys
S = input()

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

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

ans = "No"
for i in range(1,n):
  if s[i-1] == "A" and s[i] == "C":
    ans = "Yes"
    break

print(ans)

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()
for i in range(len(S) - 1):
    if S[i: i + 2] == "AC":
        print("Yes")
        exit()
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()
print('Yes' if 'AC' in s else '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()
if "AC" in S:
  print("Yes")
else:
  print("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):
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    s = str(readline().rstrip().decode('utf-8'))
    for i in range(len(s)-1):
        if s[i:i+2] == "AC":
            print("Yes")
            exit()
    print("No")


if __name__ == '__main__':
    solve()

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

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

Solution (Python):


s = input()
n = len(s)
ans = 'No'

for i in range(0, n-1):
    if s[i:i+2] == 'AC':
        ans = 'Yes'
        break

print(ans)

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] + s[i+1] == 'AC':
    print('Yes')
    exit()
else:
  print('No')

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

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

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

Solution (Python):

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

flag = True

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

Solution (Python):
s = list(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 "AC" in s else "No")

Solution (Python):

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

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

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

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"

print(ans)

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

Solution (Python):

import sys
sys.setrecursionlimit(10000)
INF = 1<<32

YES = "Yes"  
NO = "No"  

def solve(S: str):
    print(YES) if S.count('AC') >= 1 else print(NO)
    return



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

if __name__ == '__main__':
    main()

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

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

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

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

print("No")

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

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

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

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

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

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

Solution (Python):
def slove():
    import sys
    input = sys.stdin.readline
    s = str(input().rstrip('\n'))
    print("Yes" if len(s) != len(s.replace("AC", "")) else "No")


if __name__ == '__main__':
    slove()

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

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

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

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

if __name__ == '__main__':
    main()

Solution (Python):




def main():
    S = input()

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

    print("No")


if __name__ == '__main__':
    main()

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

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

f1 = False
f2 = False

for i in range(len(s)):
        if s[i] == 'A':
                f1 = True
        if f1 and s[i] == 'C':
                f2 = True
                f1 = False
                break
        if s[i] != 'A':
                f1 = False

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

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

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

Solution (Python):
s = input()
for i in range(len(s)):
  if 'AC' in s:
    ans =1
  else:
    ans =0
print('Yes' if ans ==1 else 'No')

Solution (Python):
from sys import stdin

def readString() :
    return  stdin.readline().rstrip()

def solve() :
    S = readString()
    pos = S.find('AC')
    if(pos!=-1):
        print("Yes")
    else :
        print("No")
solve()

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

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()
    for i in range(len(S)-1):
        if S[i:i+2] == "AC":
            return "Yes"
    return "No"

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

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=list(input())
l=len(s)
ans="No"
for i in range(l-1):
    if(s[i]=="A" and s[i+1]=="C"):
        ans="Yes"
print(ans)

Solution (Python):
S=input()

before=''
for s in S:
  if before+s=='AC':
    print('Yes')
    exit()
  before=s
print('No')

Solution (Python):
def slove():
    import sys
    input = sys.stdin.readline
    s = str(input().rstrip('\n'))
    for i in range(1, len(s)):
        if s[i] == "C" and s[i-1] == "A":
            print("Yes")
            exit()
    print("No")


if __name__ == '__main__':
    slove()

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

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

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

Solution (Python):



S = input()






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

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

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



s=list(input())
n=len(s)
for i in range(n-1):
        tmp="".join(s[i:i+2])
        if tmp=="AC":
                print("Yes")
                exit()
print("No")

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

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

Solution (Python):
from sys import exit

from copy import deepcopy
import numpy as np

import bisect

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))


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

    print('No')

main()

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()
flag = 0
for i in s:
    if i == 'A':
        flag = 1
        continue
    if i == 'C' and flag == 1:
        print('Yes')
        exit()
    flag = 0
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
print('Yes' if flag else 'No')

Solution (Python):
S = input()

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

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

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

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

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

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

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

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

for i in range(n-1):
    if "AC" in S:
        print("Yes")
        exit()

print("No")

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

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

print("No")

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

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

Solution (Python):
S = str(input())
for i in range(4):
    if S[i:i+2]=="AC":
        print("Yes")
        exit()
print("No")

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

Solution (Python):
print(["Yes", "No"][not(input().count("AC"))])

Solution (Python):

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


if __name__ == "__main__":
    main()

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

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


if __name__ == "__main__":
    main()

Solution (Python):
s = input()

if 'A' in s and 'C' == s[(s.index('A')+1)]:
    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):
import re
s = input().rstrip()
print('Yes' if re.search('AC', s) else 'No')

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

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

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

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

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

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

Solution (Python):
import bisect
import os
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import sys

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")

S = sys.stdin.readline().rstrip()
if 'AC' in S:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):

import sys

import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

readl= lambda: list(map(int, sys.stdin.readline().split()))
readt= lambda: tuple(map(int, sys.stdin.readline().split()))
read = lambda: sys.stdin.readline().rstrip()
readi = lambda: int(read())
readmi = lambda: map(int, sys.stdin.readline().split())
readms = lambda: map(str, sys.stdin.readline().split())

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

Solution (Python):

import sys
def input(): return sys.stdin.readline().rstrip()
def mi(): return map(int, input().split())


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

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

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

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

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

Solution (Python):

"""
A - Can you get AC?
https://atcoder.jp/contests/code-festival-2017-qualc/tasks/code_festival_2017_qualc_a

"""
import sys


def solve(S):
    if 'AC' in S:
        return 'Yes'
    return 'No'


def main(args):
    S = input()
    ans = solve(S)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

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

solve()

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

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

Solution (Python):
s=input()

if s.count("AC") >=1:
  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):
print("NYoe s"["AC"in input()::2])

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

Solution (Python):
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=list(input())
s.append("0")
flag=0
for i in range(5):
  if s[i]=="A" and s[i+1]=="C":
    flag=1
    break
  elif s[i]=="0":
    break
if flag==1:
  print("Yes")
else:
  print("No")

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

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

Solution (Python):


import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

S=input()

if S.count('AC'):
    Yes()
else:
    No()

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

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

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

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

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

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

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

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

Solution (Python):
S = input()
flag = False

for i in range(4):
    if S[i:i+2] == "AC":
        flag = True

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

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

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

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

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

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):
import re;print('Yes'if re.match('.*AC',input())else'No')

Solution (Python):
S = input()

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

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

Solution (Python):
S = input()

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

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

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

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

Solution (Python):
import sys

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

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

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

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()
for i in range(len(s)):
  if s[i]=="A":
    for j in reversed(range(i,len(s))):
      if s[j] == "C":
        if j==i+1:
          print("Yes")
          exit()
print("No")

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

Solution (Python):
S=input()

f=-1

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

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

Solution (Python):
S = input()
for s, ns in zip(S, S[1:]):
  if s + ns == "AC":
    print("Yes")
    exit()
print("No")