#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i,n) for(int i=0;i<n;i++)

const ll mod = ll(1e9) + 7;
const int INF = 1<<29;

int main(){
    string s;
    cin >> s;
    vector<char> t;
    rep(i,s.size()){
        if (i<s.size()-1 && s[i]=='a' && s[i+1]=='o'){
            t.push_back('k');
        } else if (s[i-1]=='a' && s[i]=='o'){
            t.push_back('i');
        } else {
            t.push_back(s[i]);
        }
    }
    rep(i,t.size()) cout << t[i];
    cout << endl;
    return 0;
}