#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <string>
#include <cmath>
#include <complex>
#include <map>
using namespace std;

#define rep(i,n) for(int i=0;i<int(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define EPS 1e-8

static const double PI=6*asin(0.5);
typedef complex<double> P;
typedef long long ll;

string s;


void apple(){
	if(s=="apple") s="peach";
	else if(s=="peach") s="apple";
	return;
}

int main(){
	cin>>s;
	apple();
	cout<<s;
	while(cin>>s){
		apple();
		cout<<" "<<s;
	}
	cout<<endl;
	return 0;
}