#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!"\n);
#define D(X) cout << "  "<<#X<<": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long long LINT;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
#define IN(n) int n; scanf("%d", &(n));
#define FOR(i, m, n) for (int i(m); i<n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
#define FI first
#define SE second
void ga(int N, int *A){F(N)scanf("%d",A+i);}
#define MX (14)
int X,N,g[4][MX],E[MX],C[4];
#define CC(C) (C==67?0:C==68?1:C=='H'?2:3)
#define VL(C) (C==65?0:isdigit(C)?C-48:C=='X'?10:C=='J'?11:C=='Q'?12:13)
char s[66];
bool edd(){
    F(4)if(E[i]&&!C[i])return 0;
    return 1;
}
bool dfs(int u,int l,int p){
    ++C[u];
    if(edd())return 1;
    if(l>6)return 0;
    if(~p&&C[u]==E[u])FF(4)if(u^j&&g[j][p]){
        g[j][p]=g[u][p]=0;
        if(dfs(j,l+1,p))return 1;
        g[j][p]=g[u][p]=1;
    }
    F(MX)if(g[u][i])FF(4)if(u^j&&g[j][i]){
        //printf("%d → %d → %d\n",u,i,j);
        g[j][i]=g[u][i]=0;
        if(dfs(j,l+1,i))return 1;
        g[j][i]=g[u][i]=1;
    }
    --C[u];
    return 0;
}
int main(){
    while(~scanf("%d",&N)){
        CL(C,0),CL(g,X=0),CL(E,0);
        F(N)scanf("%s",s),++g[CC(s[1])][VL(*s)],++E[CC(s[1])];
        F(4&&!X)X|=dfs(i,0,-1);
        puts(X?"YES":"NO");
    }
    return 0;
}