/************************************************
Algorithmen und Problemloesungen mit C++,
http://www.algorithmen-und-problemloesungen.de
Copyright @2007 by Doina Logofatu
************************************************/

#include <string>
#include <fstream>
#include <cctype>

const std::string VOWELS="aeiouAEIOU";

bool isVowel(char c){
  return
    VOWELS.find(c, 0)!=std::string::npos;
}

char p(char c){
  return
    islower(c)?'p':'P';
}

std::string trGB(char* s){
  int n = (int) strlen(s);
  std::string t;
  for(int i=0; i<n; i++){
    t += s[i];
    if(isVowel(s[i])){
      t += p(s[i]);
      t += s[i];
    }
  }
  return t;
}

std::string trBG(char* s){
  int n = (int) strlen(s);
  std::string t;
  for(int i=0; i<n; i++){
    t+=s[i];
    if(isVowel(s[i])) i+=2;
  }
  return t;
}

int main(){
  std::string (*fun[])(char*)={trGB, trBG};
  std::ifstream in("vogel.in");
  std::ofstream out("vogel.out");
  char *s=new char[100];
  std::string ss;
  int n;
  in>>n; n--;
  if(0<=n && n<=1)
    while(in && !in.eof()){        
      in.getline(s, 200);
      ss = (*fun[n])(s);
      out<<ss<<std::endl;
    }
  return 0;
}