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.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner scanner = null;
		try {
			scanner = new Scanner(System.in);
			String s = scanner.next();
			if (s.contains("AC")) {
				System.out.println("Yes");
				return ;
			}
			System.out.println("No");

		} finally {
			if (scanner != null) {
				scanner.close();
			}
		}
	}
}
