#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    int n;
    cin >> n;
    cin.ignore();
    for (int _ = 0; _ < n; ++_) {
        string s;
        getline(cin, s);
        for (int i = 0; i+6 < s.size(); ++i) {
            if(s.substr(i, 7) == "Hoshino"){
                s[i+6] = 'a';
            }
        }
        cout << s << "\n";
    }
    return 0;
}
