CF Div3 1080 A

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

constexpr ll mod = 1e9+7;

void solve(){
    ll n; cin >> n;
    vector<ll> a(n); for (ll &i : a) cin >> i;
    // check if 67 is present or not
    cout << (count(a.begin(), a.end(), 67) ? "YES" : "NO") << '\n';

}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr);

    ll t; cin >> t;
    while (t--) solve();
}

// TC -> O(n)
// SC -> O(1)