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`.

Examples

Input

BACD


Output

Yes


Input

ABCD


Output

No


Input

CABD


Output

No


Input

ACACA


Output

Yes


Input

XX


Output

No
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
    public static void main(String[] args) {
        try {
            // 標準入力
            InputStreamReader isr = new InputStreamReader(System.in);
            BufferedReader br = new BufferedReader(isr);
            String str = br.readLine();
            boolean flag1 = false;
            boolean flag2 = false;
            for (int i = 0; i < str.length(); i++) {
                char ch = str.charAt(i);
                if (ch == 'A') {
                    flag1 = true;
                } else if (ch == 'C') {
                    if (flag1) {
                        flag2 = true;
                        break;
                    } else {
                        flag1 = false;
                    }
                } else {
                    flag1 = false;
                }
            }
            if (flag2) {
                System.out.println("Yes");
            } else {
                System.out.println("No");
            }
        } catch (IOException e) {
            e.printStackTrace();
        }
    }
}
