#include <bits/stdc++.h>
 #define ll long long
 #define ull unsigned long long
 #define pi 3.141592654
 #define NUM 1e18
 #define Mod  1'000'000'007
 #define fixed(n) fixed<<setprecision(n)
 #define cin(v) for(auto &i:v) cin >> i ;
 #define cout(v) for(auto &i:v) cout << i  <<" ";
 #define vowel(x) (x=='e'||x=='a'||x=='i'||x=='o'||x=='u')
 #define small(x) (x>=97&&x<=122)
 #define capital(x) (x>=65&&x<=90)
 #define Tolower(s) transform(s.begin(),s.end(),s.begin(),::tolower);
 #define Toupper(s) transform(s.begin(),s.end(),s.begin(),::toupper);
 #define all(v) ((v).begin()), ((v).end())
 #define allr(v) ((v).rbegin()), ((v).rend())
 #define updmax(a,b) a=max(a,b)
 #define updmin(a,b) a=min(a,b)
 //#define ceil(a,b) ((a/b)+(a%b?1:0))
 /* asc -> 1 2 3 ,des -> 3 2 1 */
 /***********************************************************************************/
 using namespace std;
 void Rofyda_Elghadban(){
  #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
   #endif
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
 }

  bool cmp(pair<int, int>& a, pair<int, int>& b){
    return a.second < b.second;
  }

 void solve(){
    int t;
    cin>>t;
    while(t--){
    int n,t;
    cin>>n;
    vector<char>v(n),v1;
    string s,ans,ans1;
    for(int i=0;i<n;i++){
      cin>>v[i];
      if(i<n&&i>=n-3){
        s+=v[i];
      }else{
        v1.push_back(v[i]);
      }
    }
    t=stoi(s)-stoi(s)%8;
    ans1=to_string(t);
    if(ans1.size()<3&&n>3){
      v1.push_back('0');
      for(int i=0;i<ans1.size();i++){
        v1.push_back(ans1[i]);
      }
    }else{
      for(int i=0;i<ans1.size();i++){
        v1.push_back(ans1[i]);
      }
    }
    for(int i=0;i<v1.size();i++){
      ans+=v1[i];
    }
    cout<<ans<<"\n";
    }
 }

 int main(){
  Rofyda_Elghadban();
  solve();

  return 0;
 }