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# (.NET Core 3.1.201) (judge verdict: Accepted)

using System;
using System.Collections.Generic;
using System.Text;

namespace AtCoder
{
  class Program
  {
    static void Main(string[] args)
    {
      long mod = 1000000007;
      string s = Console.ReadLine();

     if( s.EndsWith("s"))
        Console.WriteLine(s + "es");
     else
        Console.WriteLine(s + "s");
      //int N = int.Parse(Console.ReadLine());

      //long[] ns = new long[2001];
      //for(int i = 3; i <= N; i++)
      //{
      //  long x = 1;
      //  for(int j = 3; j <= i - 3; j++)
      //  {
      //    x += ns[j];
      //    x %= mod;
      //  }
      //  ns[i] = x;
      //}

      Console.ReadLine();
    }
    
  }
}