#include<iostream>
#include<string.h>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#define ll long long int
#define ld long double
#define INF 1000000000
#define EPS 0.0000000001
#define rep(i,n) for(i=0;i<n;i++)
using namespace std;
typedef pair<int, int> P;

char str[1005]={};

int main()
{
  char word[1000][1000]={};
  int i=0,j;
  char search[6][10]={"apple","peach","apple.","peach.","apple,","peach,"};
  char change[6][10]={"peach","apple","peach.","apple.","peach,","apple,"};
  while(scanf("%s",str)!=EOF){
    strcpy(word[i],str);
    i++;
  }
  int num=i;//????????°
  rep(i,num){
    bool ch=true;

    rep(j,6)
      if(strcmp(word[i],search[j])==0){
	cout<<change[j];
	ch=false;
      }

    if(ch)
      cout<<word[i];

    if(i==num-1)
      cout<<endl;
    else
      cout<<" ";
  }
  
}