Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

B. Solitaire

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputA boy named Vasya wants to play an old Russian solitaire called "Accordion". In this solitaire, the player must observe the following rules:

- A deck of
*n*cards is carefully shuffled, then all*n*cards are put on the table in a line from left to right; - Before each move the table has several piles of cards lying in a line (initially there are
*n*piles, each pile has one card). Let's number the piles from left to right, from 1 to*x*. During one move, a player can take the whole pile with the maximum number*x*(that is the rightmost of remaining) and put it on the top of pile*x*- 1 (if it exists) or on the top of pile*x*- 3 (if it exists). The player can put one pile on top of another one only if the piles' top cards have the same suits or values. Please note that if pile*x*goes on top of pile*y*, then the top card of pile*x*becomes the top card of the resulting pile. Also note that each move decreases the total number of piles by 1; - The solitaire is considered completed if all cards are in the same pile.

Vasya has already shuffled the cards and put them on the table, help him understand whether completing this solitaire is possible or not.

Input

The first input line contains a single integer *n* (1 ≤ *n* ≤ 52) — the number of cards in Vasya's deck. The next line contains *n* space-separated strings *c*_{1}, *c*_{2}, ..., *c*_{n}, where string *c*_{i} describes the *i*-th card on the table. Each string *c*_{i} consists of exactly two characters, the first one represents the card's value, the second one represents its suit. Cards on the table are numbered from left to right.

A card's value is specified by one of these characters: "2", "3", "4", "5", "6", "7", "8", "9", "T", "J", "Q", "K", "A". A card's suit is specified by one of these characters: "S", "D", "H", "C".

It is not guaranteed that the deck has all possible cards. Also, the cards in Vasya's deck can repeat.

Output

On a single line print the answer to the problem: string "YES" (without the quotes) if completing the solitaire is possible, string "NO" (without the quotes) otherwise.

Examples

Input

4

2S 2S 2C 2C

Output

YES

Input

2

3S 2C

Output

NO

Note

In the first sample you can act like that:

- put the 4-th pile on the 1-st one;
- put the 3-rd pile on the 2-nd one;
- put the 2-nd pile on the 1-st one.

In the second sample there is no way to complete the solitaire.

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/23/2017 04:17:12 (c4).

Desktop version, switch to mobile version.
User lists

Name |
---|