#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
//const int mod = 1000000007;
//const int mod = 998244353;

void solve(){
  int n;
  string s;
  cin >> n >> s;
  string ans;
  string t = "dlrowolleh";
  reverse(s.begin(), s.end());
//  cout << s << endl;
  string c;
  rep(i, 0, s.size()) {
    if (ans.size()) break;
    bool flag = true;
    c = s;
    if (i+t.size() > s.size()) continue;
    rep(j, 0, t.size()) {
      if (s[i+j] == t[j] || s[i+j] == '?') c[i+j] = t[j];
      else flag = false;
    }
    if (flag) ans = c;
  }
  reverse(ans.begin(), ans.end());
  if (ans.size() == 0) cout << -1 << endl;
  else {
    rep(i, 0, ans.size()) {
      if (ans[i] == '?') cout << 'a';
      else cout << ans[i];
    }
    cout << endl;
  }
  return;
}

int main()
{
  int t;
  cin >> t;
  while(t--) solve();
  return 0;
}