Problem:
Score : 100 points

Problem Statement

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters.

In Taknese, the plural form of a noun is spelled based on the following rules:

If a noun's singular form does not end with s, append s to the end of the singular form.

If a noun's singular form ends with s, append es to the end of the singular form.

You are given the singular form S of a Taknese noun. Output its plural form.

Constraints

S is a string of length 1 between 1000, inclusive.

S contains only lowercase English letters.

Input

Input is given from Standard Input in the following format:

S

Output

Print the plural form of the given Taknese word.

Sample Input 1

apple

Sample Output 1

apples

apple ends with e, so its plural form is apples.

Sample Input 2

bus

Sample Output 2

buses

bus ends with s, so its plural form is buses.

Sample Input 3

box

Sample Output 3

boxs

Solution in C++ (GCC 9.2.1) (judge verdict: Wrong Answer)

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define input(n,a) int n;cin>>n;int a[n];for(int i=0;i<n;i++)cin>>a[i];
#define ouput(n,a) for(int i=0;i<n;i++)cout<<a[i]<<" ";
#define sort(v) sort(v,v+n);
#define endl "\n"
#define umap unordered_map<int,int>
#define uset unordered_set<int>
void solve()
{
	string s;
	cin>>s;
	int len=s.length();
	if(s[len-1]=='s')
		s.push_back('s');
	else if(s[len-1]=='e')
		s.push_back('s');
	else
	{
		s.push_back('e');
		s.push_back('s');
	}
	cout<<s;
}


int32_t main()
{
	int t=1;
	//cin>>t;
	while(t--)
		solve();
}