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):
import sys

input_methods=['clipboard','file','key']
using_method=0
input_method=input_methods[using_method]

tin=lambda : map(int, input().split())
lin=lambda : list(tin())
mod=1000000007



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

isTest=False

def pa(v):
	if isTest:
		print(v)
		
def input_clipboard():
	import clipboard
	input_text=clipboard.get()
	input_l=input_text.splitlines()
	for l in input_l:
		yield l

if __name__ == "__main__":
	if sys.platform =='ios':
		if input_method==input_methods[0]:
			ic=input_clipboard()
			input = lambda : ic.__next__()
		elif input_method==input_methods[1]:
			sys.stdin=open('inputFile.txt')
		else:
			pass
		isTest=True
	else:
		pass
		
			
	ret = main()
	if ret is not None:
		print(ret)

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

print(n)

Solution (Python):
s = input()

if s[len(s)-1] == 's':
    s = s + 'es'
elif s[len(s)-1] != 's':
    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()
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()
l = []
for i in s:
  l.append(i)
if l[-1] == 's':
    l.append('es')
    print("".join(j for j in l))
else:
    l.append('s')
    print("".join(j for j in l))

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

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

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

Solution (Python):

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

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

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

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

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

print(S)

Solution (Python):
s = input()

if s[-1] != "s":
  s = s + "s"
  
else:
  s = s + "es"
  
print(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):
s = input()
if s[-1]=='s':
  print(s+'es')
else:
  print(s+'s')

Solution (Python):
def run(s):
    '''

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

if __name__ == '__main__':
    s = input()

    run(s)

Solution (Python):
s = input()
if( s[ -1] == 's' ):
  s += 'es'
else:
  s += 's'
 
print( 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":
    S = S + "es"
else:
    S = S + "s"
print(S)

Solution (Python):
x = str(input(""))

lists = []

lists.append(x)

y = x[-1]

if y != "s":

    addd = x + "s"

else:

    addd = x + "es"

print(addd)

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

Solution (Python):
word = input()
ans = []
j = 0
for i in word:
    j += 1

if word[j - 1] != 's':
    ans = word + 's'
elif word[j - 1] == 's' and j >= 1:
    ans = word + 'es'
print(ans)

Solution (Python):
def main():
    s = input()

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

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()
print(S+'es' if S.endswith('s') else S+'s')

Solution (Python):
import sys,math
from collections import deque,defaultdict
import operator as op
from functools import reduce

sys.setrecursionlimit(10**6) 

I=sys.stdin.readline

 

"""
x_move=[-1,0,1,0,-1,1,1,-1]
y_move=[0,1,0,-1,1,1,-1,-1]
"""
def ii():
	return int(I().strip())
def li():
	return list(map(int,I().strip().split()))
def mi():
	return map(int,I().strip().split())

def ncr(n, r):
    r = min(r, n-r)
    numer = reduce(op.mul, range(n, n-r, -1), 1)
    denom = reduce(op.mul, range(1, r+1), 1)
    return numer // denom

def gcd(x, y):
    while y:
        x, y = y, x % y
    return x
def divi(n):
	if n==1:
		return 1
	cnt=2
	for i in range(2,int(n**.5)+1):
		if n%i==0:
			if i==n//i:
				cnt+=1
			else:
				cnt+=2
	return cnt


def main():
	n=I().strip()
	if n[-1]=='s':
		print(n+'es')
	else:
		print(n+'s')
	

























	
	
	





if __name__ == '__main__':
	main()

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

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

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):
word = input()
ans = []
j = 0
for i in word:
    j += 1

if word[j - 1] != 's':
    ans = word + 's'
elif word[j - 1] == 's' and j >= 1:
    ans = word + 'es'
print(ans)

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

Solution (Python):
s = input()

last = s[len(s) - 1:]

if last == 's':
  print(s + 'es')
else:
  print(s + 's')

Solution (Python):
S = input()

ls = S[-1:]

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

Solution (Python):
word=input()

last_letter=word[int(len(word))-1]

if last_letter=="s":
  print(word+"es")
else:
  print(word+"s")

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

Solution (Python):
n = input()

if n.endswith('s'):
  plural = n + 'es'
  print(plural)
else :
  plural = n + 's'
  print(plural)

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

Solution (Python):
def actual(s: str) -> str:
    tail = s[-1]

    if tail == 's':
        return s + 'es'
    else:
        return s + 's'

s = input()
print(actual(s))

Solution (Python):
def main():
    S = input()

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

    print(S)



main()

Solution (Python):
x = str(input(""))
lists = []
lists.append(x)
y = x[-1]
if y != "s":
    addd = x + "s"
else:
    addd = x + "es"
print(addd)

Solution (Python):

S = input()

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

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

Solution (Python):
string = input()

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

print(out)

Solution (Python):
s=input()
n=len(s)

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

Solution (Python):
s = input()
a = 's'
if s[-1] == 's':
    a = 'es'
s = s + a
print(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):
x= str(input())
a=list(x)
l=len(a)
if a[l-1]=='s':
    print(x+'es')
else:
    print(x+'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 + '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=list(input())
n=int(len(S))
ans=''
if S[n-1]=='s':
        ans=''.join(S)+'es'
else:
        ans=''.join(S)+'s'

print(ans)

Solution (Python):
a = input()
b = [str(c) for c in a]

if b[-1] == "s":
  b.append("es")
  
else:
  b.append("s")

print(''.join(b))

Solution (Python):
import bisect
from collections import deque
import copy
import heapq
import sys
import itertools
import math
import queue
input = sys.stdin.readline
sys.setrecursionlimit(1000000)

mod = 998244353

def read_values(): return map(int, input().split())
def read_index(): return map(lambda x: int(x) - 1, input().split())
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for n in range(N)]



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


if __name__ == "__main__":
    main()

Solution (Python):
AA=str(input())
AB=AA[-1]
if AB=='s':
  print(AA+'es')
else:
  print(AA+'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):
def main():
    s = input()

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

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

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

Solution (Python):
s=input()
if(s[-1]=='s'):
    s=s+"es"
    print(s)
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):
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


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

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

print(c)

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

Solution (Python):
val = input()

if(val[-1] == 's'):
  print(val + 'es')
else:
  print(val+'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 + 's')
else:
    print(s + 'es')

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

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
from typing import Any, Callable, Deque, Dict, List, Mapping, Optional, Sequence, Set, Tuple, TypeVar, Union































def main():
    Num = Union[int, float]
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input():  return sys.stdin.readline().rstrip()
    def ii():     return int(input())
    def isp():    return input().split()
    def mi():     return map(int, input().split())
    def mi_0():   return map(lambda x: int(x)-1, input().split())
    def lmi():    return list(map(int, input().split()))
    def lmi_0():  return list(map(lambda x: int(x)-1, input().split()))
    def li():     return list(input())
    def debug(x): print(x, file=sys.stderr)
    
    
    
    s = input()
    if s[-1] == 's':
        print(s + 'es')
    else:
        print(s + 's')


if __name__ == "__main__":
    main()

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

Solution (Python):
if __name__ == '__main__':
  s = str(input())

  if s[-1] != 's':
    print(f'{s}s')
  else:
    print(f'{s}es')

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

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 os,sys

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

print(s)

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

Solution (Python):
def main():
    i = input()
    if(i[-1]=="s"):
        print(i+'es')
    else:
        print(i+'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.endswith("s"): print(S + "es")
else: print(S + "s")

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

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

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

Solution (Python):
S = input()
if S[len(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()
m = 's'
n = 'es'
if S[-1] == 's':
	res = "".join((S,n))
	print(res)
else:
	res1 = "".join((S,m))
	print(res1)

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

Solution (Python):
s=input()
l=len(s)
list_s=list(s)
ans=""
if(s[l-1]!="s"):
    list_s.append("s")
elif(s[l-1]=="s"):
    list_s.append("es")

for i in range(0,len(list_s)):
    ans+=list_s[i]

print(ans)

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

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

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

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

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

Solution (Python):
S = input()

l = len(S)
if S[l-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):
a = list(input())
if a[-1] == 's':
  a.append('e')
  a.append('s')
else:
  a.append('s')

print(''.join(a))

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':
    print(S + 'es')
else:
    print(S + 's')

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

Solution (Python):
input = input()
if input[-1] == "s":
    print(input + "es")
else:
    print(input + "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":
  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(len(s)==0):
  print("")
if(s[-1] == "s"):
  print(s+"es")
if(s[-1] != "s"):
  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":
    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()
if s[-1] == 's':
    s += 'es'
else:
    s += 's'
print(s)

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

Solution (Python):
word = input()

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

Solution (Python):
a = input()

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

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

Solution (Python):
word = input()

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

Solution (Python):
s=input()
v='s'
if s[-1]=='s':
    v='es'

print(s+v)

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):
import math

a = input()
if a.endswith('s'):
    print(a + "es")
else:
    print(a + '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"
else:
    s += "es" 
print(s)

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

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):
word = input()
if word.endswith("s"):
    print(word+"es")
else:
    print(word+"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")
elif S[-1]!="s":
    print (S+"s")

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

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

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

Solution (Python):
S = input()

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

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

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

Solution (Python):
S = input()
l = len(S)

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

Solution (Python):
s=list(input())
length=len(s)
if(s[length-1]=='s'):
  s.append('es')
else:
  s.append('s')

s = ''.join(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 + 'es')
else:
    print(S + 's')

Solution (Python):
S = input()

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

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

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

print( S + fix )

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

Solution (Python):
s=input()
s_list=list(s)
 
x=len(s_list)

if s_list[x-1]=="s":
  s_list.append("es")
else:
  s_list.append("s")

print("".join(s_list))

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()
n = len(s)
if s[n-1] == 's':
    print(s+'es')
else:
    print(s+'s')

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

if S[i]=="s":
    out=S+"es"
else:
    out=S+"s"

print(out)

Solution (Python):



s = input()
s1 = list(s)

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

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

if S[len(S)-1] != 's':
  S.append('s')
else:
  S.append('es')

print(''.join(S))

Solution (Python):
a = input()
arr = list(a)
if arr[-1] == "s":
  arr.insert(len(arr), "es")
  print("".join(arr))
else:
  arr.insert(len(arr), "s")
  print("".join(arr))

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

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

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

es = list("es")
ss = list("s")




f = s[len(s)-1]


if f == "s":
  ans = s+es
  ans = "".join(ans)
  print(ans)
else:
  ans = s+ss
  ans = "".join(ans)
  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):
from sys import stdin
from collections import defaultdict
input = stdin.readline

T = 1
for t in range(1,T + 1):
	s = input()
	s = s[:len(s) - 1]
	if s[len(s) - 1] == 's':
		s += 'es'
	else:
		s += 's'
	print(s)

Solution (Python):
a=input()
if(a[-1]=="s"):
    a.rstrip("s")
    print(a,"es",sep="")
else:
    print(a,"s",sep="")

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

Solution (Python):


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


answer(input())

Solution (Python):
word = input()
if word[-1] == 's':
  print(word, end='es\n')
else:
  print(word, end='s\n')

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

Solution (Python):
X=list(input())
if X[len(X)-1]=='s':
    X.append('e')
    X.append('s')
else:
    X.append('s')
print("".join(X))

Solution (Python):

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

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

Solution (Python):
S = input()
l = []
for i in S:
  l.append(i)
if l[-1] == 's':
    l.append('es')
    print("".join(j for j in l))
else:
    l.append('s')
    print("".join(j for j in l))

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

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

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

print(S)

Solution (Python):
inp = input()
print(inp,end='')
if inp[-1] == 's':
    print("e",end='')
print("s")

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

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

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

Solution (Python):
S = input()

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

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

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

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

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

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

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

Solution (Python):
a=input()
b=list(a)

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

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

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

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

Solution (Python):


S = input()

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

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

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

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

Solution (Python):
s = input()

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

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

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

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

Solution (Python):
n = input()
n = [ c for c in n]
if(n[-1]=='s'):
    n.append('es')
elif(n[-1]!='s'):
    n.append('s')
n=''.join(n)
print(n)

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()
print(S + ("es" if S[-1]=="s" else "s"))

Solution (Python):
s = input()
l = len(s)
x = s[l-1]
if x == "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):
S = input()
a = len(S)
if S[a-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 math
s=input()
if(s[len(s)-1]=='s'):
    print(s+'es')
else:
    print(s+'s')

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

Solution (Python):
s=list(input())
if s[-1]=='s':
  s.append('e')
s.append('s')
ans=''
for i in range(len(s)):
  ans+=s[i]
print(ans)

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

Solution (Python):
s=input()
l=list(s)

if(l[-1]=='s'):
	l.append('e')
	l.append('s')
else:
	l.append('s')

str1=""

for i in l:
	str1+=i
print(str1)

Solution (Python):

st = input()

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

print(st)

Solution (Python):
s = []
s =  input()

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

Solution (Python):
s=str(input())
s_split=list(s)
s_last=s_split[-1]


if s_last == 's' :
    print(s+'es')
else:
    print(s+'s')

Solution (Python):
string = input()

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

Solution (Python):
def plural():
	s = input()
	if s[-1] == 's' : ans = s + "es"
	else : ans = s + "s"
	return ans

def main()	:
	print(plural())

if __name__	 == '__main__' :
	main()

Solution (Python):
a = input()
if(a[-1] == "s"):
	print(a + "es")
else:
	print(a+"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):
'''
    Auther: ghoshashis545 Ashis Ghosh
    College: jalpaiguri Govt Enggineering College

'''
from os import path
import sys
from heapq import heappush,heappop
from functools import cmp_to_key as ctk
from collections import deque,defaultdict as dd 
from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right
from itertools import permutations
from datetime import datetime
from math import ceil,sqrt,log,gcd
def ii():return int(input())
def si():return input().rstrip()
def mi():return map(int,input().split())
def li():return list(mi())
abc='abcdefghijklmnopqrstuvwxyz'
mod=1000000007

inf = float("inf")
vow=['a','e','i','o','u']
dx,dy=[-1,1,0,0],[0,0,1,-1]

def bo(i):
    return ord(i)-ord('a')



    
def solve():

    
    


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

    print(s) 












        
if __name__ =="__main__":

    
    if path.exists('input.txt'):
        sys.stdin=open('input.txt', 'r')
        sys.stdout=open('output.txt','w')
    else:
        input=sys.stdin.readline
    solve()

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

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

Solution (Python):
a = input()
b = [x for x in a]

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

Solution (Python):
a=str(input())
if a[-1]=="s":
    print(a+"es")
else:
    print(a+"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):
def i_input(): return input()


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

print(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 = str(input())

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

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

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

Solution (Python):
str = input()

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

else:
    print(str+"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 = s + 'e'

s = s + 's'
print(s)

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

Solution (Python):
S = input()
l = []
for i in S:
  l.append(i)
if l[-1] == 's':
    l.append('es')
    print("".join(j for j in l))
else:
    l.append('s')
    print("".join(j for j in l))

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

Solution (Python):
S = input()

n = len(S)

S_a = list(S)

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

Solution (Python):
input_n = input()
n = str(input_n)

listN = list(n)


if listN[len(listN) - 1] == "s":
    listN.append("e")
    listN.append("s")
else:
    listN.append("s")

for i in range(len(listN)):
    print(listN[i], end = "")

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

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

print(ans)

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):
x = input()
if x[-1] != 's':
    print(x+'s')
else:
    print(x+'es')

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):
s = input()
if s[-1] == "s":
  print(s+"es")
else:
  print(s+"s")

Solution (Python):
s=input()
sss=list(s)
sss.reverse()
if sss[0]=="s":
    print(s+"es")
else:
    print(s+"s")