#include #ifndef SHO_LOCAL #include #define debug(...) ; #else #include "debug.h" #endif #define all(x) (x).begin(), (x).end() #define lb(x, a) lower_bound(all(x), (a)) - (x).begin() typedef long long ll; using namespace std; static inline vector z_algo(const string &s) { int n = (int)s.size(); vector Z(n); int from = -1, until = -1; for (int i = 1; i < n; i++) { int &a = Z[i]; if (from != -1) { a = max(0, min(Z[i - from], until - i)); } while (i + a < n && (s[i + a] == s[a] || s[a] == '?' || s[i + a] == '?')) { a++; } if (until < i + a) { until = i + a; from = i; } } Z[0] = n; return Z; } static inline vector z_algo2(const string &s) { int n = (int)s.size(); vector Z(n); int from = -1, until = -1; for (int i = 1; i < n; i++) { int &a = Z[i]; if (from != -1) { a = max(0, min(Z[i - from], until - i)); } while (i + a < n && (s[i + a] == s[a] || s[i + a] == '?' || s[a] == '?')) { a++; } if (until < i + a) { until = i + a; from = i; } } Z[0] = n; return Z; } int main() { iostream::sync_with_stdio(0), cin.tie(0); int T; cin >> T; int n; string s; const string S = "helloworld$"; while (T--) { cin >> n >> s; string t = S + s; auto Z = z_algo(t); bool ok = false; for (int i = Z.size() - 1; i >= (int)S.size(); i--) { if (Z[i] >= 10) { ok = true; for (int j = 0; j < i; j++) { if (t[j] == '?' || (t[j] >= 'A' && t[j] <= 'Z')) t[j] = 'A'; } for (int j = 0; j < 10; j++) { if (t[i + j] == '?' || (t[i + j] >= 'A' && t[i + j] <= 'Z')) { if (t[i + j] == '?') { t[i + j] = 'z' + 1; } t[i + j] = min(char(S[j] - 'a' + 'A'), t[i + j]); } } for (int j = i + 10; j < (int)Z.size(); j++) { if (t[j] == '?' || (t[j] >= 'A' && t[j] <= 'Z')) t[j] = 'A'; } string ans = t.substr(S.size()); for (char &c : ans) { if ('A' <= c && c <= 'Z') { c = c - 'A' + 'a'; } } cout << ans << '\n'; } } if (!ok) cout << -1 << '\n'; } return 0; }