//No.24 数当てゲーム #pragma GCC optimize("O3") #pragma GCC target("avx") #include #define rep(i ,n) for(int i=0;i<(int)(n);++i) #define repr(i ,n) for(int i=n;i>(int)(n);--i) #define rep1(i ,n) for(int i=1;i<=(int)(n);++i) #define ALL(a) a.begin(), a.end() #define RSORT(a) sort(ALL(a),greater<>()) #define SORT(a) sort(ALL(a)) #define bit_check(bit, i) ((bit>>(i)) & 1) #define PRINT(x) cout << (x) << endl; #define ENDL cout << endl; using namespace std; typedef long long int i64; typedef unsigned long long u64; template using V = vector; using VI = V; const int INF = 2e9; const i64 MOD = 1e9 + 7; template inline bool chmin(T& a, T b){if(a>b){a=b; return true;} return false;} template inline bool chmax(T& a, T b){if(a> n; vector> a(n ,vector(4)); vector r(n); rep( i , n){ rep( j , 4){ cin >> a[i][j]; } cin >> r[i]; } set st; rep( i , n){ if(r[i] == "YES"){ rep( j , 10){ if( a[i][0] != j && a[i][1] != j && a[i][2] != j && a[i][3] != j) st.insert(j); } } else if( r[i] == "NO") { rep( j , 10){ rep( k , 4){ if( a[i][k] == j) st.insert(j); } } } } int ret = 45; for( auto&& c : st ){ ret -= c; } cout << ret << endl; }