#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector #define vs vector #define vc vector #define vl vector #define vb vector #define vvi vector> #define vvc vector> #define vvl vector> #define vvb vector> #define vvvi vector>> #define vvvl vector>> #define pii pair #define pil pair #define pli pair #define pll pair #define vpii vector> #define vpll vector> #define vvpii vector>> #define vvpll vector>> template void debug(T e) { cerr << e << endl; } template void debug(vector &v) { rep(i, v.size()) { cerr << v[i] << " "; } cerr << endl; } template void debug(vector> &v) { rep(i, v.size()) { rep(j, v[i].size()) { cerr << v[i][j] << " "; } cerr << endl; } } template void debug(vector> &v) { rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; } } template void debug(set &st) { for (auto itr = st.begin(); itr != st.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template void debug(multiset &ms) { for (auto itr = ms.begin(); itr != ms.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template void debug(map &mp) { for (auto itr = mp.begin(); itr != mp.end(); itr++) { cerr << itr->first << " " << itr->second << endl; } } void debug_out() { cerr << endl; } template void debug_out(Head H, Tail... T) { cerr << H << " "; debug_out(T...); } using mint = modint998244353; void debug_mint1(vector &vec) { for (int i = 0; i < vec.size(); i++) { cerr << vec[i].val() << " "; } cerr << endl; } void debug_mint2(vector> &vec) { for (int i = 0; i < vec.size(); i++) { for (int j = 0; j < vec[i].size(); j++) { cerr << vec[i][j].val() << " "; } cerr << endl; } } vector n_adic(ll i, ll n, ll N) { ll x = 1; rep(j, N) { x *= n; } vector vec(N); rep(j, N) { x /= n; vec[j] = i / x; i -= x * vec[j]; } return vec; } int main() { vector A(8); for (ll i = 0; i < 8; i++) { cin >> A[i]; } unordered_set ust; ust.insert(stoll(A[0])); // cout << (*ust.begin()) << endl; for (ll i = 1; i < 8; i++) { unordered_set nust; for (auto it = ust.begin(); it != ust.end(); it++) { ll val = *it; for (ll j = 0; j < 8; j++) { ll tp = val / 10000000; val = (val - tp * 10000000) * 10 + tp; vector ad = n_adic(val, 10, 8); bool pos = true; for (ll k = 0; k < 8; k++) { if ((ll)(A[i][k] - '0') > ad[k]) { pos = false; break; } } if (pos) { nust.insert(val - stoll(A[i])); } } } ust.clear(); for (auto it = nust.begin(); it != nust.end(); it++) { ust.insert(*it); } } if (ust.find(0) != ust.end()) { cout << "Yes" << endl; } else { cout << "No" << endl; } }