Codeforces - A . Telephone Number

A telephone number is a sequence of exactly 11 digits, where the first digit is 8. For example, the sequence 80011223388 is a telephone number, but the sequences 70011223388 and 80000011223388 are not.
You are given a string s of length n, consisting of digits.
In one operation you can delete any character from string s. For example, it is possible to obtain strings 112, 111 or 121 from string 1121.
You need to determine whether there is such a sequence of operations (possibly empty), after which the string s becomes a telephone number.
Input The first line contains one integer t (1≤t≤100) — the number of test cases.
The first line of each test case contains one integer n (1≤n≤100) — the length of string s.
The second line of each test case contains the string s (|s|=n) consisting of digits.
Output For each test print one line.
If there is a sequence of operations, after which s becomes a telephone number, print YES.
Otherwise, print NO.
Example inputCopy 2 13 7818005553535 11 31415926535 outputCopy YES NO Note In the first test case you need to delete the first and the third digits. Then the string 7818005553535 becomes 88005553535.

#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#define ll long long
#define dd double
using namespace std;

int main() {
	ll n;
	ll t;
	cin >> t;
	while (t--) {
		cin >> n;
		string s;
		cin >> s;
		ll flag = 0;
		for (ll i = 0; i < s.size(); i++) {
			if (s[i] == '8' && s.size() - i >= 11) {
				flag = 1;
				break;
			}
		}
		if (flag == 1) {
			cout << "YES" << endl;
		}
		else {
			cout << "NO" << endl;
		}
	}
}