#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("Yes");}else{puts("No");} #define MAX_N 200005 int main() { string s; cin >> s; int n = s.size(); rep(i,n-1){ if(s[i] == 'a' && s[i+1] == 'o'){ s[i] = 'k'; s[i+1] = 'i'; } } cout << s << endl; return 0; }