#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include <map>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <algorithm>
#include <array>
#include <unordered_set>
#include <unordered_map>
#include <string>
using namespace std;

bool rcmp(int a, int b) { return a>b; }
typedef long long LL;


char ib[1024];
int main() {
    int n, i, j;
    const char *p = "helloworld";
    int tc; scanf("%d", &tc); while(tc) { tc--;
        scanf("%d %s", &n, ib);
        for (i=n-1; i>=9; i--) {
            for (j=0; j<10; j++) {
                if (ib[i-(9-j)]=='?'||ib[i-(9-j)]==p[j]) {
                } else break;
            }
            if (j>=10) {
                for (j=0; j<10; j++) ib[i-(9-j)]=p[j];
                break;
            } 
            if (ib[i]=='?') ib[i]='a';
        }
        if (i>=9) {
            while(i>=0) {
                if (ib[i]=='?') ib[i]='a';
                i--;
            }
            printf("%s\n", ib);
        } else printf("-1\n");
    }
    return 0;
}