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: Runtime Error)

/******************************************************************************

Welcome to GDB Online.
GDB online is an online compiler and debugger tool for C, C++, Python, PHP, Ruby, 
C#, VB, Perl, Swift, Prolog, Javascript, Pascal, HTML, CSS, JS
Code, Compile, Run and Debug online from anywhere in world.

*******************************************************************************/

#include <stdio.h>
#include <string.h>

int main()
{
    char S[1000];
    int l;
    
    scanf("%s",S);
    l =strlen(S);
    //printf("%c\n", S[l-1]);
    
    if(S[l-1]!='s'){
        S[l]='s';
        //printf("%c\n",S[l-1]);
        //printf("%c\n",S[l]);
    }
    
    
    if(S[l-1]=='s'){
        S[l]='e';
        S[l+1]='s';
        //printf("%c\n",S[l]);
        //printf("%c\n",S[l+1]);
    }
    
    printf ("%s\n",S);


    return 0;
}