
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <memory>
#include <string>

#include <algorithm>
#include <complex>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <bitset>

using namespace std;

#ifdef _MSC_VER
#define __typeof__ decltype
#define strtok_r strtok_s
#endif

#define ITER(c)             __typeof__((c).begin())
#define FOREACH(it, c)      for (ITER(c) it=(c).begin(); it != (c).end(); ++it)
#define RITER(c)            __typeof__((c).rbegin())
#define RFOREACH(it, c)     for (RITER(c) it=(c).rbegin(); it != (c).rend(); ++it)
#define REP(i, n)           REPEAT(i, 0, n)
#define RREP(i, n)          RREPEAT(i, 0, n)
#define REPEAT(i, k, n)     for(int i = (k); i < ((k)+(n)); ++i)
#define RREPEAT(i, k, n)    for(int i = (k)+(n)-1; i >= (k); --i)
#define FROMTO(i,f,t)       for(int i = f; i < t; i++)
#define ALL(c)              (c).begin(), (c).end()
#define LLPOW(p1,p2)        ((ll)pow((double)(p1), (int)p2))
#define ESIZEOF(A)          (sizeof(A)/sizeof((A)[0]))
#define CIN_NO_SYNC         do { cin.tie(0); ios_base::sync_with_stdio(false); } while(0)
#define GETSTR(p)           fgets((p), sizeof(p), stdin)
#define CHOMP(p)            do{ char *_q = (p) + strlen(p)-1; if(*_q == '\n' || *_q == '\r') *_q = 0; } while(0)
#define FILL(m,v)           memset(m, v, sizeof(m))
#define mp                  make_pair
#define pb                  push_back
template<class _T> _T MAX(_T p1,_T p2){return (p1>p2)?p1:p2;} 
template<class _T> _T MIN(_T p1,_T p2){return (p1<p2)?p1:p2;} 
template <class _Tv> inline string join(const _Tv &v,string sep=" "){
    ostringstream s;FOREACH(it,v){if(it!=v.begin())s<<sep;s<<*it;};return s.str();
}

typedef long long ll;
typedef unsigned long long ull;
typedef double D;
typedef complex<D> P;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define X real()
#define Y imag()
#define EPS (1e-9)
#define DEQ(p1,p2) (abs((p1)-(p2)) < EPS)

#ifdef _DEBUG
template<class _Tv> inline void _prfe(const char *_n,const _Tv _c,bool _p=false){
    ITER(_c) _it=_c.begin();
    if(_p){cout<<_n<<" = ["<<endl;for(;_it!=_c.end();++_it)cout<<"    "<<*_it<<endl;cout<<"]"<<endl; }
    else{cout<<_n<<" = [ "<<*_it++;for(;_it!=_c.end();++_it)cout<<", "<<*_it;cout<<" ]"<<endl; }
}
ostream &operator<<(ostream &os, const pair<int,int> &p){return(os<<"("<<p.first<<","<<p.second<<")");}
#define pf printf
#define pr(n) do{cout<<#n" = "<<(n)<<endl;}while(0)
#define prfe(n) _prfe(#n, n)
#define prfep(n) _prfe(#n, n, true)
#define dbgchk(n) do{if(n)throw;}while(0)
#else
#define pf(...) /* */
#define pr(...) /* */
#define prfe(...) /* */
#define prfep(...) /* */
#define dbgchk(...) /* */
#endif

string s[8][24];
string p[2][2][2];

bool dfs(int n, int used){
    if(n >= 8) return true;
    int x = (n>>0)&1, y = (n>>1)&1, z = (n>>2)&1;
    pf("n = %d, used = %x\n", n, used);

    REP(i,8){
        if(used & (1<<i)) continue;
        REP(j,24){
            if(x && (p[z][y][0][2] ^ s[i][j][3]) != 0x20) continue;
            if(y && (p[z][0][x][4] ^ s[i][j][1]) != 0x20) continue;
            if(z && (p[0][y][x][0] ^ s[i][j][5]) != 0x20) continue;
            p[z][y][x] = s[i][j];
            if(dfs(n+1,used | (1<<i))) return true;
        }
    }
    return false;
}

int solve(vector<string> &v){
    REP(i,8){
        REP(j,6) s[i][j] = v[i];
        s[i][1][0] = s[i][0][1]; s[i][1][1] = s[i][0][5];
        s[i][1][4] = s[i][0][0]; s[i][1][5] = s[i][0][4];
        s[i][2][0] = s[i][0][2]; s[i][2][2] = s[i][0][5];
        s[i][2][3] = s[i][0][0]; s[i][2][5] = s[i][0][3];
        s[i][3][0] = s[i][0][3]; s[i][3][2] = s[i][0][0];
        s[i][3][3] = s[i][0][5]; s[i][3][5] = s[i][0][2];
        s[i][4][0] = s[i][0][4]; s[i][4][1] = s[i][0][0];
        s[i][4][4] = s[i][0][5]; s[i][4][5] = s[i][0][1];
        s[i][5][0] = s[i][0][5]; s[i][5][2] = s[i][0][3];
        s[i][5][3] = s[i][0][2]; s[i][5][5] = s[i][0][0];
        FROMTO(j,6,24){
            if(j == 3) continue;
            s[i][j]    = s[i][j-6];
            s[i][j][1] = s[i][j-6][2]; s[i][j][2] = s[i][j-6][4];
            s[i][j][3] = s[i][j-6][1]; s[i][j][4] = s[i][j-6][3];
        }
        //REP(j,24) cout << s[i][j] << ", "; cout << endl;
    }
    REP(j,24){
        p[0][0][0] = s[0][j];
        if(dfs(1,1)){
            cout << "YES" << endl;
            return 0;
        }
    }
    cout << "NO" << endl;
    return 0;
}

int main(){
    string s;
    vector<string> v;
    while(cin >> s){
        v.pb(s);
        if(v.size() == 8){
            solve(v);
            v.clear();
        }
    }
    return 0;
}