#include using namespace std; #pragma GCC optimize("Ofast") #define all(x) (x).begin(),(x).end() #define rep(i,n) for(int (i)=0;i<(n);i++) #define REP(i,m,n) for(int (i)=(m);(i)<(n);(i)++) #define INF INT_MAX #define MOD 1000000007 #define fcout cout << fixed << setprecision(15) #define int long long #define yorn(f) puts((f)?"Yes":"No") #define YORN(f) puts((f)?"YES":"NO") #define sec second #define fir first typedef long long ll; typedef pair P; typedef priority_queue pque; typedef vector Vec; int gcd(int a,int b){return b?gcd(b,a%b):a;}; int lcm(int a,int b){return a/gcd(a,b)*b;}; int mod(int a,int b){return (a+b-1)/b;}; template void Fill(A(&array)[N],const T &val){std::fill((T*)array,(T*)(array+N),val);} templateinline bool chmax(T& a,T b){if(ainline bool chmin(T& a,T b){if(a>b){a=b;return true;}return false;}; signed main() { cin.tie(0); cout.tie(0); ios::sync_with_stdio(false); string s; cin >> s; rep(i, s.size() - 1) { if(s[i] == 'a' && s[i+1] == 'o') { s[i] = 'k'; s[i+1] = 'i'; } } cout << s << endl; return 0; }