DIGARR.cpp

// https://www.codechef.com/COOK140C/problems/DIGARR
#include <bits/stdc++.h>

using namespace std;

#define max(a,b) (a<b? b:a)
#define min(a,b) (a<b? a:b)
#define mod 1e9+7
#define FOR(a,c) for(int (a)=0;(a)<(c);(a)++)
#define FORL(a,b,c) for(int (a)=(b);(a)<=(c);(a)++)
#define FORR(a,b,c) for(int (a)=(b);(a)>=(c);(a)--)
#define INF 1000000000000000003
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define POB pop_back
#define MP make_pair
template <class T>
T modadd(T a,T b,ll m){return (a%b+b%m)%m;}
template <class T>
T modsub(T a,T b,ll m){T ans = (a%m)-(b%m);if(ans<0) ans+=m;return ans;}
template <class T>
T modmul(T a,T b,ll m){ return ((a%m)*(b%m))%m; }
vector<int> inputArray(int n){vector<int> arr(n);int i=0; FOR(i,n) cin>>arr[i];return arr;}

void func(){
	int d;cin>>d;
	string n;cin>>n;
	bool flag = false;
	for(int i=0;i<d;i++){
		int temp = int(n[i]-'0');
		// cout<<temp<<endl;
		if(temp==0 or temp==5){
			flag=true;break;
		}
	}
	if(flag){
		cout<<"YES\n";
	}else{
		cout<<"NO\n";
	}
}

int main(){
	int T;
	cin>>T;
	while(T--){
		func();
	}
	return 0;
}