FredsLottoTickets.cpp

#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <memory>
#include <iomanip>
#include <numeric>
#include <functional>
#include <new>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <climits>
#include <cctype>
#include <ctime>

#define REP(i, n) for(int (i) = 0; i < n; i++)
#define FOR(i, a, n) for(int (i) = a; i < n; i++)
#define FORR(i, a, n) for(int (i) = a; i <= n; i++)
#define for_each(q, s) for(typeof(s.begin()) q=s.begin(); q!=s.end(); q++)
#define sz(n) n.size()
#define pb(n) push_back(n)
#define all(n) n.begin(), n.end()

template<typename T> T gcd(T a, T b) {
    if(!b) return a;
    return gcd(b, a % b);
}
template<typename T> T lcm(T a, T b) {
    return a * b / gcd(a, b);
}

using namespace std;

typedef long long ll;
typedef long double ld;

int in(void) { int x; scanf("%d", &x); return x; }

int N, now, checked;
map<int, int> cover;

int main(void) {
    int i, j;
    for ( ; scanf("%d", &N) && N != 0; ) {
        cover.clear(); checked = 0;
        for (i = 0; i < N; i++) {
            for (j = 0; j < 6; j++) {
                now = in();
                cover[now] += 1;
                if (cover[now] == 1) checked += 1;
            }
        }
        if (checked == 49) {
            puts("Yes");
        } else {
            puts("No");
        }
    }
    return 0;
}