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)

int main() {
	int N = 0;
	int i = 0;
	int flag = 0, flag1 = 0, flag2 = 0;
	int result1[100] = {};
	int result2[100] = {};
	scanf("%d", &N);
	for (i = 0; i <= N; i++) {
		scanf("%d %d", &result1[i], &result2[i]);
	}
	for (i = 0; i <= N; i++) {
		if (result1[i] == result2[i]) {
			flag = 1;
		}

		if (flag) {
			if (result1[i] == result2[i]) {
				flag1 = 1;
			}
			else {
				flag = 0;
			}
		}

		if (flag1) {
			if (result1[i] == result2[i]) {
				flag2 = 1;
				break;
			}
			else {
				flag = 0;
				flag1 = 0;
			}
		}
	}
	if (flag2) {
		printf("Yes");
	}
	else {
		printf("No");
	}
	return 0;
}