#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<functional>
#include<math.h>
using namespace std;
#define N (1000000000+7)
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;


int main(void){
    string s;
    cin>>s;
    int n=s.size();
    for(int i=0;i<n-1;i++){
        if(s[i]=='a'){
            if(s[i+1]=='o'){
                s[i]='k';
                s[i+1]='i';
            }
        }
    }
    cout<<s<<endl;
    return 0;

}