#include <bits/stdc++.h>
#include <atcoder/all>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=b-1;i>=a;i--)
#define all(x) (x).begin(),(x).end()
#define pb(x) push_back(x);
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
typedef long long ll;
typedef long double lld;
using namespace std;
using namespace atcoder;
using mint = static_modint<998244353>;
// using mint = static_modint<1000000007>;
const ll mod=998244353;
//const ll mod=1e9+7;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
const string zton="0123456789";
const string atoz="abcdefghijklmnopqrstuvwxyz";
const string ATOZ="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const ll inf=(1ll<<60);
// const int inf=(1<<30);
lld dist(lld x1,lld x2,lld y1,lld y2){
    lld res=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
    res=sqrt(abs(res));
    return res;
}
lld arg(lld x,lld y){
    const lld eps=1e-8;
    lld res=0;
    if(abs(x)+abs(y)<=eps)return 0.0;
    else if(abs(x)<=eps){
        if(y>=0.0)return (M_PI/2);
        else return (M_PI/2+M_PI);
    }
    else if(abs(y)<=eps){
        if(x>=0.0)return 0.0;
        else return M_PI;
    }
    res=atan2(abs(y),abs(x));
    if(x<=0&&y>=0)res=(M_PI-res);
    else if(x<=0&&y<=0)res+=(M_PI);
    else if(x>=0&&y<=0)res=(M_PI*2-res);
    return res;
}
ll gcd(ll a,ll b){
    if(a==0||b==0)return a+b;
    ll r;
    r=a%b;
    if(r==0){
        return b;
    }
    else{
        return gcd(b,r);
    }
}
typedef pair<ll,int> P;

string vtos(vector<int> &v){
    string s="";
    rep(i,0,v.size()){
        s+=atoz[v[i]];
    }
    return s;
}

vector<int> correct={7,4,11,11,14,22,14,17,11,3};
vector<int> a;

string solve(){
    int n;cin >> n;
    vector<int> s(n);
    rep(i,0,n){
        char c;cin >> c;
        if(c=='?')s[i]=-1;
        else s[i]=c-'a';
    }
    rep(i,0,n-9){
        bool flag=true;
        rep(j,0,10){
            if(s[i+j]!=correct[j]){
                flag=false;
                break;
            }
        }
        if(flag){
            vector<int> v;
            rep(j,0,n){
                if(i<=j&&j<=i+9){
                    v.pb(correct[j-i]);
                }
                else{
                    if(s[j]==-1){
                        v.pb(0);
                    }
                    else{
                        v.pb(s[j]);
                    }
                }
            }
            return vtos(v);
        }
    }
    rrep(i,0,n-9){
        bool flag=true;
        rep(j,0,10){
            if(s[i+j]==-1)continue;
            if(s[i+j]!=correct[j]){
                flag=false;
                break;
            }
        }
        if(flag){
            vector<int> v;
            rep(j,0,n){
                if(i<=j&&j<=i+9){
                    v.pb(correct[j-i]);
                }
                else{
                    if(s[j]==-1){
                        v.pb(0);
                    }
                    else{
                        v.pb(s[j]);
                    }
                }
            }
            return vtos(v);
        }
    }
    return "-1";
}

int main(void){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;cin >> t;
    vector<string> ans(t);
    rep(i,0,t){
        ans[i]=solve();
    }
    rep(i,0,t){
        cout << ans[i] << endl;
    }

}