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 in Ruby (2.3.3) (judge verdict: Wrong Answer)

#!/usr/bin/env ruby

class String
  def has_kaibunability?
    [0, 1].include? self.strip.chars.group_by(&:itself).values.map(&:size).reject(&:even?).size
  end
end

s = gets.strip

@hunko = {}
def unko(s)
  @hunko[s.chars.sort.chunk(&:itself).map(&:last)] ||= if s.has_kaibunability?
    1
  else
    (1..(s.size - 1)).to_a.sort_by { |k| k - s.size / 2 }.map { |sp|
      (unko(s[0..(sp - 1)]) + unko(s[sp..-1])).tap { |k| return 2 if k == 2 }
    }.min
  end
end

puts unko(s)