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 (Python):
str1 = input()

if str1[len(str1)-1] == 's':
    print(str1 + 'es')
else:
    print(str1 + 's')

Solution (Python):
s = input()
if s[-1] != 's':
	print(s+'s')
else:
	print(s + 'es')

Solution (Python):
S = input()

if S[-1] == "s":
    print(S + "es")
else:
    print(S + "s")

Solution (Python):
S=input()
if S[len(S)-1]=='s':
  print(S+'es')
else:
  print(S+'s')

Solution (Python):
s = input()

if s[len(s)-1] == "s":
  print(s+"es")
else :
  print(s+"s")

Solution (Python):


n = input()
if n[-1] == "s":
    print(n + "es")
else:
    print(n + "s")

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()

S = input()

if S[-1] == 's':
    print(S + 'es')
else:
    print(S + 's')

Solution (Python):
"""
int(input())
map(int, input().split())
list(map(int, input().split()))
input()
input().split()
"""

a=input()
if(a[-1]=='s'):
    a+="es"
else:
    a+='s'

print(a)

Solution (Python):
S = input()
if S[-1] == "s":
    print(S+"es")
else:
    print(S+"s")

Solution (Python):
S= str(input())
if S[-1] == 's':
  print(S+'es')
else:
  print(S+'s')

Solution (Python):


S = input()

if S[len(S)-1] == "s":
    S += "es"
else:
    S += "s"

print(S)

Solution (Python):
s = input()
if s[-1] == "s":
    s += "es"
else:
    s += "s"
print(s)

Solution (Python):
s=input()

if s[-1] == "s":
    print(s + "es")
else:
    print(s+"s")

Solution (Python):
S = input()
if S.endswith("s"):
    S = S + "es"
else:
    S = S + "s"
print(S)

Solution (Python):
s = input()
if s[len(s)-1] == 's':
    print(s+"es")
else:
    print(s+'s')

Solution (Python):
S = list(str(input()))
if S[-1]== 's':
  print(''.join(S)+'es')
else:
  print(''.join(S)+'s')

Solution (Python):
S = input()
if S[-1] == "s":
  print(S + "es")
else:
  print(S + "s")

Solution (Python):
it = lambda: list(map(int, input().strip().split()))


def solve():
    s = input().strip()
    if s[-1] == 's':
        return s + 'es'
    return s + 's'


if __name__ == '__main__':
    print(solve())

Solution (Python):
S = list(input())

if S[-1] == "s":
  S.append("es")
else:
  S.append("s")
print("".join(S))

Solution (Python):
import sys,math,collections
from collections import defaultdict


    
def file():
    sys.stdin = open('input.py', 'r')
    sys.stdout = open('output.py', 'w') 
def get_array():
    l=list(map(int, input().split()))
    return l
def get_ints():   
    return map(int, input().split())
    
def get_3_ints():   
    a,b,c=map(int, input().split())
    return a,b,c    
def sod(n):
    n,c=str(n),0
    for i in n: 
        c+=int(i)
    return c    
def isPrime(n):
    if (n <= 1):
        return False
    if (n <= 3):
        return True
    if (n % 2 == 0 or n % 3 == 0):
        return False
    i = 5
    while(i * i <= n):
        if (n % i == 0 or n % (i + 2) == 0):
            return False
        i = i + 6
  
    return True
def getFloor(A, x):

    (left, right) = (0, len(A) - 1)

    floor = -1
    while left <= right:
        mid = (left + right) // 2
        if A[mid] == x:
            return A[mid]
        elif x < A[mid]:
            right = mid - 1
        else:
            floor = A[mid]
            left = mid + 1
            
    return floor
def chk(aa,bb):
	f=0
	for i in aa:
		for j in bb:
			if(j[0]>=i[0] and j[1]<=i[1]):
				f+=1
			elif(j[0]<=i[0] and j[1]>=i[1]):	
				f+=1
			elif(i[0]==j[1] or i[1]==j[0]):
				f+=1
			else:
				continue
	return f			


def main():

	s=input()
	if(s[-1]=='s'):
		s+='es'
	else:
		s+='s'
	print(s)	
		
	
	
		




				





		


	





        
            
        























    

    
    

        











        
        

        























































                

            







            
            
































        








if __name__ == '__main__':
    main()

Solution (Python):
s = input()

if s[-1] == 's':
  s = s + 'es'
else:
  s = s + 's'
  
print(s)

Solution (Python):
a=input()
print(a+"es" if a[-1]=="s" else a+"s")

Solution (Python):
s = input()

if s[-1] == 's':
  print(s + 'es')
else:
  print(s + 's')

Solution (Python):
s=input()

if s[len(s)-1]=="s":
    s=s+"es"
else:
    s=s+"s"
print(s)

Solution (Python):
S=input()

if list(S)[len(S)-1]=='s':
  print(S+'es')
else:
  print(S+'s')

Solution (Python):
S = input()

if S[-1] == "s":
    print(S + "es")
else:
    print(S + "s")

Solution (Python):
s = input()

if s[-1]== "s":
    print(s+"es")
else:
    print(s+"s")

Solution (Python):
s = input()
print(s + 'es' if s[-1] == 's' else s + 's')

Solution (Python):
S = input()
ans = ""
if S[-1] == "s":
    ans = S + "es"
else:
    ans = S + "s"
print(ans)

Solution (Python):
import sys
input = sys.stdin.readline

s = input()[:-1]
if s[-1] == 's':
    print(s + 'es')
else:
    print(s + 's')

Solution (Python):
s = input()
if s[-1] == "s":
  print(s+"es")
else:
  print(s+"s")

Solution (Python):

S = input()

if S[-1] == 's':
  print(S + 'es')
  
else:
  
  print(S + 's')

Solution (Python):
def main():
    s = input()
    if s[-1] == 's':
        print(s + 'es')
    else:
        print(s + 's')
        
        
if __name__ == '__main__':
    main()

Solution (Python):
S = input()

if S[-1] == "s":
    print(S + "es")
else:
    print(S + "s")

Solution (Python):
def a():
    S = input()
    if S[-1] == "s":
        res = S + "es"
    else:
        res = S + "s"
    print(res)
    
a()

Solution (Python):
def main():
    s = input()
    if s[-1] == "s":
        print(f"{s}es")
    else:
        print(f"{s}s")

if __name__ == "__main__":
    main()

Solution (Python):
S = input()
if S[-1] != 's':
    print(S+'s')
else:
    print(S+'es')

Solution (Python):
s=input()
if s[-1]=='s':
    print(s+'es')
else:
    print(s + 's')

Solution (Python):
S=input()
L=list(S)
if L[-1]=="s":
    S+="es"
else:
    S+="s"
print(S)

Solution (Python):
s=input()
n=len(s)
if(s[n-1]=='s'):
    print(s+'es')
else:
    print(s+'s')

Solution (Python):
s = input()
l = len(s)-1
if s[l] == "s":
    print(s + "es")
else:
    print(s + "s")

Solution (Python):
s=input()
if s[-1]=='s':
	print(s+'es')
else:
	print(s+'s')

Solution (Python):
import math
import fractions
import collections
import itertools
S=list(input())

if S[len(S)-1]=="s":
    S.append("es")
else:
    S.append("s")
print("".join(S))

Solution (Python):
import sys
from sys import stdin,stdout
import math
import random
import heapq
from collections import Counter
from functools import lru_cache

try:
    for _ in range(1):
        s=input()
        if s[-1]!="s":
            print(s+"s")
        else:
            print(s+"es")
        







    
except EOFError as e:
    print(e)

Solution (Python):


S = input()
if S.endswith('s'):
    print(S + 'es')
else:
    print(S + 's')

Solution (Python):
s = input()

if s[-1] == 's':
    print(s+'es')
else:
    print(s+'s')

Solution (Python):
s = input()

if s[-1] == "s":
      print(s+"es")
else:
      print(s+"s")

Solution (Python):
S=input()
n=len(S)
if S[n-1]=="s":
  print(S+"es")
else:
  print(S+"s")

Solution (Python):
s = input()
if s[-1] == "s":
    print(s+"es")
else:
    print(s+"s")

Solution (Python):
import sys
readline = sys.stdin.readline

S = readline().strip()
if S[-1] == 's':
    S += 'es'
else:
    S += 's'
print(S)

Solution (Python):
def main():
    S = input()
    if S[-1] == "s":
        print(S + "es")
    else:
        print(S + "s")
    return

if __name__ == "__main__":
    main()

Solution (Python):
s = input()
print(s+"es" if s[-1]=="s" else s+"s")

Solution (Python):








s = input()

if s[-1] == "s":
    print(s+"es")
else:
    print(s+"s")

Solution (Python):
s = input()

if s[-1] != "s":
    print(s + "s")
else:
    print(s + "es")

Solution (Python):
S = input()
if S[-1] == "s":
    print(S + "es")
else:
    print(S + "s")

Solution (Python):
a=input()
print(a+"s" if a[-1]!="s" else a+"es")

Solution (Python):

import sys

def main():
    input = sys.stdin.readline
    s = input().rstrip()
    if s[-1] == "s":
        print(s + "es")
    else:
        print(s + "s")

if __name__ == '__main__':
    main()

Solution (Python):
S = input()

if S[-1] == "s":
    print(S+"es")
else:
    print(S+"s")

Solution (Python):
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**6)
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

s = ns()

if s[-1] == 's':
    print(s+'es')
else:
    print(s+'s')

Solution (Python):
from math import *

def cin(): 
    return map(int,input().split())

def cins(): 
    return input.split()

def cino(test=False): 
    if not test:
        return int(input())
    else: 
        return input()

def cina(): 
  return list(map(int,input().split()))

def ssplit(): 
    return list(input().split())

def printlist(l): 
    for i in l:
        print(i,end=" ")

def main():
    s = cino(True)
    if s[len(s)-1]=='s':
        s += 'es'
    else:
        s += 's'
    print(s)
        

if __name__ == '__main__':
    main()

Solution (Python):
S = input()

if S[-1] == "s":
    ans = S +"es"
else:
    ans = S + "s"

print(ans)

Solution (Python):
s=input()
if s[-1]=='s':
  s+='es'
else:
  s+='s'
print(s)

Solution (Python):
S=input()
if S[-1]=='s':
    print(S+'es')
else:
    print(S+'s')

Solution (Python):




import sys









MOD = 10 ** 9 + 7
INF = 10 ** 9
PI = 3.14159265358979323846

def read_str():      return sys.stdin.readline().strip()
def read_int():      return int(sys.stdin.readline().strip())
def read_ints():     return map(int, sys.stdin.readline().strip().split())
def read_ints2(x):   return map(lambda num: int(num) - x, sys.stdin.readline().strip().split())
def read_str_list(): return list(sys.stdin.readline().strip().split())
def read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))
def GCD(a: int, b: int) -> int: return b if a%b==0 else GCD(b, a%b)
def LCM(a: int, b: int) -> int: return (a * b) // GCD(a, b)

def Main():
    s = read_str()
    if s[-1] != 's':
        s += 's'
    else:
        s += 'es'
    print(s)

if __name__ == '__main__':
    Main()

Solution (Python):
s = input()
if s[-1] == 's':
    print(s+'es')
else:
    print(s+'s')

Solution (Python):
s=input()
if s[-1]=='s':
  print(s+"es")
else:
  print(s+'s')

Solution (Python):
s = input()

if s[-1] != 's':
    print(s+'s')
else:
    print(s+'es')

Solution (Python):
s=input()

if s[-1] == 's':
    print(s + 'es')
else:
    print(s + 's')

Solution (Python):
s = str(input())

if s[-1]=='s':
    print(s+'es')
else:
    print(s+'s')

Solution (Python):
x = input()
if x[-1]=="s":
    x+="es"
else:
    x+="s"
print(x)

Solution (Python):
S = input()
if(S[-1]=='s'):
    print(S+'es')
else:
    print(S+'s')

Solution (Python):
S = input()
if S[-1] == "s":
    print(S + "es")
else:
    print(S + "s")

Solution (Python):
s = input()

if(s[-1] == 's'):
    s = s + 'es'
else:
    s = s + 's'

print(s)

Solution (Python):
s=input()
print(s+'es' if s[-1]=='s' else s+'s')

Solution (Python):
S = input()
ans = S
if S[-1] == 's':
    ans += 'es'
else:
    ans += 's'

print(ans)

Solution (Python):
s=input()

if s[-1]=="s":
    print(s+"es")
else:
    print(s+"s")

Solution (Python):
import sys

def main():
    S = sys.stdin.readline().rstrip()

    if S[-1] == "s":
        print(S + "es")
    else:
        print(S + "s")


main()

Solution (Python):
s = input()

if s[-1] == 's':
    print(s+'es')
else:
    print(s+'s')

Solution (Python):
s=input()
if s[len(s)-1]=="s":
  print(s+"es")
else:
  print(s+"s")

Solution (Python):

s = input()

if s[-1]=="s":
  print(s+"es")

else:
  print(s+"s")

Solution (Python):
S = input()
ls = len(S) - 1

if S[ls] == 's':
   print(S + 'es')
else:
   print(S + 's')

Solution (Python):
S = input()
s = len(S)
if S[s-1] == "s":
  ans = S + "es"
else:
  ans = S + "s"
print(ans)

Solution (Python):
S = input()
if S[-1] == "s":
    print("".join([S,"es"]))
else:
    print("".join([S,"s"]))

Solution (Python):
S = input()

if S[-1] == 's':
  print(S + 'es')
else:
  print(S + 's')

Solution (Python):
s=input()
print(s+'e'*(s[-1]=='s')+'s')

Solution (Python):
S = input()

if S[- 1] == 's':
    S += 'es'
else:
    S += 's'

print(S)

Solution (Python):
S = input()
if S[-1] == 's':
    print(S + 'es')
else:
    print(S + 's')

Solution (Python):
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))
def getArray(intn):
    return [int(input()) for i in range(intn)]
def input():
    return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
    return random.randint(ran1, ran2)
def rand_List(ran1, ran2, rantime):
    return [random.randint(ran1, ran2) for i in range(rantime)]
def rand_ints_nodup(ran1, ran2, rantime):
  ns = []
  while len(ns) < rantime:
    n = random.randint(ran1, ran2)
    if not n in ns:
      ns.append(n)
  return sorted(ns)

def rand_query(ran1, ran2, rantime):
  r_query = []
  while len(r_query) < rantime:
    n_q = rand_ints_nodup(ran1, ran2, 2)
    if not n_q in r_query:
      r_query.append(n_q)
  return sorted(r_query)

from collections import defaultdict, deque, Counter
from sys import exit
from decimal import *
from heapq import heapify, heappop, heappush
import math
import random
import string
from copy import deepcopy
from itertools import combinations, permutations, product
from operator import mul, itemgetter
from functools import reduce
from bisect import bisect_left, bisect_right

import sys
sys.setrecursionlimit(1000000000)
mod = 10 ** 9 + 7





S = input()

if S[-1] == 's':
    print(S + 'es')
else:
    print(S + 's')

Solution (Python):
import sys

def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())

s = S()

if s[-1]=='s':
    print(s+'es')
else:
    print(s+'s')

Solution (Python):
s=input()
if(s[-1]=='s'):
    s=s+"es"
else:
    s=s+'s'
print(s)

Solution (Python):
s = input()
if s[-1]=='s': print(s+'es')
else: print(s+'s')

Solution (Python):
S = input()

if (S[-1] == 's'):
    print(S + 'es')
else:
    print(S + 's')

Solution (Python):
s = input()
print(s+'es' if s[-1] == 's' else s+'s')

Solution (Python):
s = input()
if s[-1] == 's':
    print(s + 'es')
else:
    print(s + 's')

Solution (Python):
from sys import stdin

def main():

    input = stdin.readline

    S = input()[:-1]

    if S[-1] == "s":
        print(S + "es")
    else:
        print(S + "s")


if __name__ == "__main__":
    main()

Solution (Python):


import sys

DEBUG = False


def read(t):
    return t(sys.stdin.readline().rstrip())


def read_list(t, sep=" "):
    return [t(s) for s in sys.stdin.readline().rstrip().split(sep)]


def dprint(*args, **kwargs):
    if DEBUG:
        print(*args, **kwargs)
    return


def main():
    s = read(str)
    if s.endswith("s"):
        s += "es"
    else:
        s += "s"
    print(s)


if __name__ == "__main__":
    main()

Solution (Python):
s = input()

if s[-1] == 's':
    s += 'es'
else:
    s += 's'

print(s)

Solution (Python):
def resolve():
    s = input()
    if s[-1] == "s":
        print(s + "es")
    else:
        print(s+"s")
resolve()

Solution (Python):
a = input().strip()
if a[-1]=="s":
  print(a+"es")
else:
  print(a+"s")

Solution (Python):
s=input()
print(s+"es" if s[-1]=="s" else s+"s")

Solution (Python):
s = input()
if s[-1] == 's':
    print(s+'es')
else:
    print(s+'s')

Solution (Python):
S = str(input())


if S[-1] == "s":
  print(S + "es")
else:
  print(S + "s")

Solution (Python):
S=input()
if S[-1]=='s':
    print(S+'es')
else:
    print(S+'s')

Solution (Python):
a = input()
if a[-1] == "s":
    a = a+"es"
    print(a)
else:
    a = a+"s"
    print(a

    )

Solution (Python):
s = input()
if s[-1] == "s": s += "e"
s += "s"
print(s)

Solution (Python):
S = input()
if S[-1] == 's':
    print(S + 'es')
else:
    print(S + 's')

Solution (Python):
S=input()
if S[-1]=='s':
  print(S+'es')
else:
  print(S+'s')

Solution (Python):
S = input()

if S[-1] != 's':
    print(S + 's')
else:
    print(S + 'es')

Solution (Python):
s = input()

if s[-1] == "s":
  print(s+"es")
else:
  print(s+"s")

Solution (Python):
s = input()
if(s[-1] == "s"):
  print(s+"es")
else:
  print(s+"s")

Solution (Python):
s=input()  
if s[-1]=='s':
  print(s+'es')
else:
  print(s+'s')

Solution (Python):
s=input()

if s[-1] == 's':
    print(s + 'es')

else:
    print(s + 's')

Solution (Python):
S=str(input())
if S[-1]=="s":
    print(S+"es")
else:
    print(S+"s")

Solution (Python):
S = input()
if S[-1] == "s":
  print(S + "es")
else:
  print(S + "s")

Solution (Python):
from sys import stdin
inp = lambda : stdin.readline().strip()

s = inp()
if s[-1] != 's':
    print(s+'s')
else:
    print(s+'es')

Solution (Python):
s = input()
if s[-1] != "s":
  print(s + "s")
else:
  print(s + "es")

Solution (Python):
S = input()
if S[-1] == 's':
  print(S+'es')
else:
  print(S+'s')

Solution (Python):
S=input()
if S[-1]=='s':
  print(S+'es')
else:
  print(S+'s')

Solution (Python):
S = input()
if S[-1] == 's':
  print(S + 'es')
else:
  print(S + 's')

Solution (Python):
S = input()
if S[-1] == "s":
    print(S + "es")
else:
    print(S + "s")

Solution (Python):
s =  input()
if s[-1] == 's':
    s += 'es'
else:
    s += 's'
print(s)

Solution (Python):
strs = input()
if strs[-1] == "s":
    ans = strs + "es"
else:
    ans = strs + "s"
print(ans)

Solution (Python):
s=input()
if s[-1]=='s':
    print(s+'es')
else:
    print(s+'s')

Solution (Python):
s = input()
if s[-1] == "s":
    print(s+"es")
else:
    print(s+"s")

Solution (Python):
s=input()
if s[-1]=="s":
  print(s+"es")
else:
  print(s+"s")

Solution (Python):
l = input()
if l[-1] == 's':
  print(l+'es')
else:
  print(l+'s')

Solution (Python):
def abc179a():
    s = input()
    if s[-1] == 's':
        print(s+'es')
    else:
        print(s+'s')
abc179a()

Solution (Python):

import sys,io,os,time
from collections import defaultdict
from collections import Counter
from collections import deque
from itertools import combinations
from itertools import permutations
import bisect,math,heapq
alphabet = "abcdefghijklmnopqrstuvwxyz"





s = input()
if s[-1] == "s":
	print(s+"es")
else:
	print(s+"s")








'''


import collections,sys,threading
sys.setrecursionlimit(10**9)
threading.stack_size(10**8)



threading.Thread(target=solve).start()
'''

Solution (Python):
S=input()
if S[-1]=="s":
    print(S+"es")
else:
    print(S+"s")

Solution (Python):
s = input()
if s[-1] == 's':
  print(s+'es')
else:
  print(s+'s')

Solution (Python):
S = input()
if S[-1] == 's':
    print(S+'es')
else:
    print(S+'s')

Solution (Python):
S = str(input())
if S[-1] == 's':
    print(S + 'es')
else:
    print(S + 's')

Solution (Python):
S = str(input())

if S[-1] == 's':
  print(S+'es')
else:
  print(S+'s')

Solution (Python):

import sys


def solve(S: str):
    if S[-1] == 's':
        S += "es"
    else:
        S += "s"
    print(S)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  
    solve(S)

if __name__ == '__main__':
    main()

Solution (Python):
s = input()

if s[-1] == "s":
    s += "es"
else:
    s += "s"

print(s)

Solution (Python):
s=input()
print(s+"s" if s[-1]!="s" else s+"es")

Solution (Python):
s = input()
if s[len(s)-1] != "s":
    print(s+"s")
else:
    print(s+"es")

Solution (Python):
s = input()
if s[-1] == "s":
  print(s + "es")
else:
  print(s + "s")

Solution (Python):
def main():
    s = input()
    if s[-1]=='s':
        s+='es'
        print(s)
    else:
        s+='s'
        print(s)

if __name__ == "__main__":
    main()

Solution (Python):
S = input()
if S[-1] != 's':
  print(S+'s')
else:
  print(S+'es')

Solution (Python):
def li():
    return [int(x) for x in input().split()]


S = input()

if S[-1] == 's':
    S += 'es'
else:
    S += 's'

print(S)

Solution (Python):
from collections import defaultdict
from collections import deque
from collections import Counter
import math
import itertools

def readInt():
	return int(input())
def readInts():
	return list(map(int, input().split()))
def readChar():
	return input()
def readChars():
	return input().split()

s = input()

if s[-1]=="s":
	print(s+"es")
else:
	print(s+"s")

Solution (Python):
s=input()
if s[-1]=="s":
    print(s+"es")
else:
    print(s+"s")

Solution (Python):
s=input()

if s[-1] == 's':
  print(s + 'es')
else:
  print(s + 's')

Solution (Python):

import sys 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
S = readline().decode().rstrip()
if S[-1] == 's':
    print(S+'es')
else:
    print(S+'s')

Solution (Python):
S = input()

if S[-1] == 's':
    print(S + 'es')
else:
    print(S + 's')

Solution (Python):
S = input()
print(S + 'es' if S[-1] == 's' else S + 's')

Solution (Python):
s = str(input())

if s[-1] == "s":
    print(s + "es")
else:
    print(s + "s")

Solution (Python):
b=input()
if b[-1]=='s' :
  print(b+'es')
else :
  print(b+'s')

Solution (Python):
s = input()
a = s[-1]
if(a == 's'):print(s+"es")
else:print(s+"s")

Solution (Python):
s = input()
if s[-1]!='s': print(s+'s')
else: print(s+'es')

Solution (Python):
S = input()
if S[-1] == 's':
    print(S + 'es')
else:
    print(S + 's')

Solution (Python):
S = input()
if S[-1] is "s":
    print(S + "es")
else:
    print(S + "s")

Solution (Python):
def main():
    S = input()
    if S[-1] == 's':
        print(S + 'es')
    else:
        print(S + 's')

if __name__ == '__main__':
    main()

Solution (Python):
S = input()
if S[-1] == "s":
    print(S + "es")
else:
    print(S + "s")

Solution (Python):
s=input()
if s[-1]=="s":
    s=s+"es"
else:
    s=s+"s"
print(s)

Solution (Python):



import sys


def std_in():
    return sys.stdin.readline().strip()


def get_ints():
    return map(int, sys.stdin.readline().strip().split())


def main():
    s = std_in()

    if s[-1] == "s":
        print(s + "es")
    else:
        print(s + "s")


if __name__ == "__main__":
    main()

Solution (Python):
import sys, math
from collections import defaultdict, deque, Counter
from bisect import bisect_left, bisect_right
from itertools import combinations, permutations, product
from heapq import heappush, heappop
from functools import lru_cache
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mat = lambda x, y, v: [[v]*y for _ in range(x)]
ten = lambda x, y, z, v: [mat(y, z, v) for _ in range(x)]
mod = 1000000007
sys.setrecursionlimit(1000000)

s = rs()

if s[-1] != 's':
	print(s+'s')
else:
	print(s+'es')

Solution (Python):
def main():
    a = input()
    if a.endswith('s'):
        print(a + 'es')
    else:
        print(a + 's')


if __name__ == '__main__':
    main()

Solution (Python):
S = input()

if S[-1] == "s":
  print(S+"es")
else:
  print(S+"s")

Solution (Python):
s = input()

if s[-1] == 's':
   print(s + 'es')
else:
   print(s + 's')

Solution (Python):
s = input()
if s[-1]=="s":
    print(s+"es")
else:
    print(s+"s")

Solution (Python):
s = input()
if s[-1] == 's':
    print(s+'es')
else:
    print(s+'s')

Solution (Python):
S = input()

if S[-1] == 's':
    ans = S + 'es'
else:
    ans = S + 's'

print(ans)

Solution (Python):
s = input()

if s[-1] == 's':
    print(s + 'es')
else:
    print(s+'s')

Solution (Python):
s=input()
if s[-1]=='s':
    print(s+'es')
else:
    print(s+'s')

Solution (Python):
import sys
import math


def input():
    return sys.stdin.readline().rstrip()


def main():
    S=input()
    if S[-1]=="s":
        print(S+"es")
    else:
        print(S+"s")






if __name__ == "__main__":
    main()

Solution (Python):
S = input()

if S[-1] != 's':
    S += 's'
else:
    S += 'es'

print(S)

Solution (Python):




S = input()






if S[-1] == 's':
    print(S + 'es')
else:
    print(S + 's')

Solution (Python):
s = str(input())
if s[-1] == 's':
    print(s + 'es')
else:
    print(s + 's')

Solution (Python):
s = input('')

if s.endswith("s"):
    print(s + "es")
else:
    print(s + "s")

Solution (Python):
import math
ini = lambda : int(input())
inm = lambda : map(int,input().split())
inl = lambda : list(map(int,input().split()))
gcd = lambda x,y : gcd(y,x%y) if x%y else y
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])
    if arr==[]:
        arr.append([n, 1])
    return arr
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)
    divisors.sort()
    return divisors
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
mod = 10**9 + 7



s = input()
if s[-1] == 's':
    s += 'es'
else:
    s += 's'
print(s)

Solution (Python):
S = input()
print(S + ('s' if S[-1] != 's' else 'es'))

Solution (Python):


from collections import defaultdict
mod = 10 ** 9 + 7; INF = float("inf")

def getlist():
	return list(map(int, input().split()))

def inverse(N, mod):
	return (pow(N, mod - 2, mod))

def main():
	S = input()
	if S[-1] == "s":
		print(S + "es")
	else:
		print(S + "s")
	

if __name__ == '__main__':
	main()

Solution (Python):
S = list(input())
if S[-1] == 's':
    S.append('es')
else:
    S.append('s')
print(''.join(S))

Solution (Python):
s = input()

if s[-1] == 's':
    print(s + 'es')
else:
    print(s + 's')

Solution (Python):
def main():
    s = input()
    if s[-1]=='s':
        s += 'es'
    else:
        s += 's'
    print(s)

main()

Solution (Python):
S = input()
if S[-1]=='s':
    print(S+'es')
else:
    print(S+'s')

Solution (Python):
s=input()
if s[len(s)-1]=="s":
    print(s[:-1]+"ses")
else:
    print(s+"s")

Solution (Python):
s=str(input())
if s[-1]=='s':
    print(s+'es')
else:
    print(s+'s')

Solution (Python):
S=input()

if S[-1]=='s':
    S += "es"
else:
    S += "s"
print(S)

Solution (Python):
S = input()
if S[-1] == "s":
    print(S + "es")
else:
    print(S + "s")

Solution (Python):
s = input()
if s[-1]=='s':
  s+='es'
else:
  s+='s'
print(s)

Solution (Python):
word=input()
if word[-1]=='s':
  word+="es"
else:
  word+="s"
print(word)

Solution (Python):
s = str(input())
if s[-1] == 's':
    print(s + 'es')
else:
    print(s + 's')

Solution (Python):
S = input()
if S[-1]=='s':
    print(S+'es')
else:
    print(S+'s')

Solution (Python):
s = str( input() )
if s[ -1 ] == "s":
    s = s + "e"
print( s + "s" )

Solution (Python):
def main():
    s = input()
    if s[-1] != 's':
        s = s+'s'
    else:
        s = s+'es'

    print(s)
    

main()

Solution (Python):
S=input()
if S[-1]=='s':
  T=S+'es'
else:
  T=S+'s'
print(T)

Solution (Python):
"""

"""
s = input()

if s[-1] == "s":
    s += "es"
else:
    s += "s"

print(s)

Solution (Python):
s = input()

if s[-1] == "s" :
  print(s + "es")
else :
  print(s + "s")

Solution (Python):
s = input()
if s[-1] == "s":
    print(s+"es")
else:
    print(s+"s")

Solution (Python):
a=input()
if a[-1]=='s':
    print(a+'es')
else:
    print(a+'s')

Solution (Python):
S = input()

if S.endswith('s'):
    print(S + 'es')
else:
    print(S + 's')

Solution (Python):
s = input()
if s[-1] == 's':
    print(s + 'es')
else:
    print(s + 's')

Solution (Python):
s = input()

if s[-1] == 's':
    print(s+'es')
else:
    print(s+'s')

Solution (Python):
S = input()

if S[-1] == 's':
    S += 'es'
else:
    S += 's'
print(S)

Solution (Python):
s = input()

if s[-1]=="s":
    print("{}es".format(s))
else:
    print("{}s".format(s))

Solution (Python):
i1=lambda : input()
i2=lambda : int(input())
i3=lambda : map(int,input().split())
i4=lambda n : [list(map(int,input().split()) for _ in range(n))]

S=i1()

print(S+'es' if S[-1]=='s' else S+'s')

Solution (Python):
S=input()

end=S[-1]

if(end=="s"):
    print(S+"es")
else:
    print(S+"s")

Solution (Python):
import sys
import math
import collections
import bisect
import itertools
import decimal
import copy
import heapq




INF = 10 ** 20
MOD = 10 ** 9 + 7


ni = lambda: int(sys.stdin.readline().rstrip())
ns = lambda: map(int, sys.stdin.readline().rstrip().split())
na = lambda: list(map(int, sys.stdin.readline().rstrip().split()))
na1 = lambda: list(map(lambda x: int(x) - 1, sys.stdin.readline().rstrip().split()))
flush = lambda: sys.stdout.flush()



def main():
    s = input()
    if s[-1] == "s":
        s += "es"
    else:
        s += "s"

    print(s)


if __name__ == '__main__':
    main()

Solution (Python):
S = input()

if S[-1] == 's':
    print(S+'es')
else:
    print(S+'s')

Solution (Python):
S = input()
if S[-1] == "s": print(S + "es")
else: print(S + "s")

Solution (Python):
'''بِسْمِ اللَّهِ الرَّحْمَٰنِ الرَّحِيمِ'''

gi = lambda : list(map(int,input().split()))
s = input()
if s[-1] == 's':
  print(s + 'es')
else:
  print(s + 's')

Solution (Python):
import sys
import math
import collections
import decimal
import itertools
from collections import deque
from functools import reduce
import heapq
import copy
import numpy as np


s = input()


if s[len(s)-1] == "s":
    print(s + "es")
else:
    print(s + "s")

Solution (Python):
s = input()
if s[-1] == 's':
    print(s + 'es')
else:
    print(s + 's')

Solution (Python):
def solve(S):
    if S[-1] == 's':
        S += 'es'
    else:
        S += 's'

    return S


if __name__ == "__main__":
    S = input()
    print(solve(S))