%epigraph%%epigraphtext% _When the curtains are opened, a canvas unfolds outside. Kanno marvels at all the blonde colours along the riverside — not tangerines, but blossoms instead."What a pity it's already late spring," sighs Mino with regret, "one more drizzling night and they'd be gone."
"But these blends are at their best, aren't they?" Absorbed in the landscape, Kanno remains optimistic._%endepigraphtext%%endepigraph%The landscape can be expressed as a row of consecutive cells, each of which either contains a flower of colour amber or buff or canary yellow, or is empty.
When a flower withers, it disappears from the cell that it originally belonged to, and it spreads petals of its colour in its two neighbouring cells (or outside the field if the cell is on the side of the landscape). In case petals fall outside the given cells, they simply become invisible.
You are to help Kanno determine whether it's possible that after some (possibly none or all) flowers shed their petals, at least one of the cells contains all three colours, considering both petals and flowers. Note that flowers can wither in arbitrary order.
## Input
The first and only line of input contains a non-empty string $s$ consisting of uppercase English letters '_A_', '_B_', '_C_' and characters '_._' (dots) only ($\lvert s \rvert \leq 100$) — denoting cells containing an amber flower, a buff one, a canary yellow one, and no flowers, respectively.
## Output
Output "_Yes_" if it's possible that all three colours appear in some cell, and "_No_" otherwise.
You can print each letter in any case (upper or lower).
[samples]
## Note
In the first example, the buff and canary yellow flowers can leave their petals in the central cell, blending all three colours in it.
In the second example, it's impossible to satisfy the requirement because there is no way that amber and buff meet in any cell.
Let $ s $ be a string of length $ n $ over the alphabet $ \{ \texttt{A}, \texttt{B}, \texttt{C}, \texttt{.} \} $, where:
- $ \texttt{A} $: cell contains an amber flower,
- $ \texttt{B} $: cell contains a buff flower,
- $ \texttt{C} $: cell contains a canary yellow flower,
- $ \texttt{.} $: empty cell.
Each flower at position $ i $ (0-indexed) can wither and spread petals of its color to its neighbors: positions $ i-1 $ and $ i+1 $, if they exist.
Let $ C_i \subseteq \{ \texttt{A}, \texttt{B}, \texttt{C} \} $ denote the set of colors present in cell $ i $ after any subset of flowers have withered, where:
- The original flower (if any) contributes its color.
- Each neighboring flower that withers contributes its color.
We are to determine:
Does there exist an index $ i \in \{0, 1, \dots, n-1\} $ such that $ C_i = \{ \texttt{A}, \texttt{B}, \texttt{C} \} $?
---
**Formal Condition:**
There exists an index $ i \in [0, n-1] $ such that:
$$
\{ \texttt{A}, \texttt{B}, \texttt{C} \} \subseteq
\left( \{ s[i] \} \cup \{ s[i-1] \mid i-1 \geq 0 \} \cup \{ s[i+1] \mid i+1 < n \} \right)
\setminus \{ \texttt{.} \}
$$
Equivalently, define for each cell $ i $:
$$
\text{Colors}(i) = \left\{ x \in \{ \texttt{A}, \texttt{B}, \texttt{C} \} \mid x = s[i] \text{ or } x = s[i-1] \text{ (if } i > 0\text{) or } x = s[i+1] \text{ (if } i < n-1\text{)} \right\}
$$
Then output "Yes" if $ \exists i \in [0, n-1] $ such that $ \text{Colors}(i) = \{ \texttt{A}, \texttt{B}, \texttt{C} \} $, else "No".
---
**Alternative Equivalent Formulation:**
Let $ A, B, C \subseteq \{0, 1, \dots, n-1\} $ be the sets of indices where characters 'A', 'B', 'C' appear respectively.
Then, for a cell $ i $ to contain all three colors, it must satisfy:
- $ i \in A \cup (A-1) \cup (A+1) $,
- $ i \in B \cup (B-1) \cup (B+1) $,
- $ i \in C \cup (C-1) \cup (C+1) $,
where $ S \pm 1 = \{ x \pm 1 \mid x \in S \} \cap [0, n-1] $.
Thus, output "Yes" if:
$$
\left( A \cup (A-1) \cup (A+1) \right) \cap \left( B \cup (B-1) \cup (B+1) \right) \cap \left( C \cup (C-1) \cup (C+1) \right) \neq \emptyset
$$
Otherwise, output "No".