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

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

Solution (Python):
S = input()
if len(S) >= 1 and len(S) <= 1000:
	if S[-1] == "s":
  		print (S, "es", sep = '')
	else:
  		print (S, "s", sep = '')

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

Solution (Python):
n = input()

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

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
     
def main():
    s = S()
    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()
print(S+'s' if S[-1]!='s' else 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":
    s += "s"
else:
    s += "es"
print(s)

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

Solution (Python):
s=list(input())
if s[-1]=="s":
  s.append("e")
  s.append("s")
else:
  s.append("s")

print("".join(s))

Solution (Python):
S = input()

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

else:
    S = S + "s"

print("{}".format(S))

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

Solution (Python):
def solve():
    string = list(input())
    ans = 0
    if string[-1]=="s":
        ans = "".join(string)+"es"
        print(ans)
        return 
    else:
        print("".join(string)+"s")
        return

solve()

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

Solution (Python):
s = input()

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

print(s)

Solution (Python):
def INT():
    return int(input())

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

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

S = input()

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

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

print(a)

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

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

Solution (Python):
s = input()
n = len(s)
end = s[n-1]
if end=='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()
l=len(S)
s=list(S)
if s[l-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 + ("s" if S[-1] != "s" else "es"))

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

Solution (Python):
string = input()

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

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

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

print(s)

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

print(result)

Solution (Python):

import sys
from math import factorial

MOD = 10 ** 9 + 7
INF = 10000000000


def main():
    
    
    a = input()     

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

if __name__ == '__main__':
    main()

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

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

print(S)

Solution (Python):
S = input()

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

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


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

Solution (Python):
S = input()

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

Solution (Python):
S = input()
Ss = '{}s'.format(S) if not S.endswith('s') else '{}es'.format(S)
print(Ss)

Solution (Python):
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): 
    return list(map(int,input().split()))
def m(): 
    return map(int,input().split())
def onem(): 
    return int(input())
def s(x): 
    a = []
    if len(x) == 0:
        return []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): 
    return " ".join(map(str,x))
def max2(x): 
    return max(map(max,x))
def In(x,a): 
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False

def pow_k(x, n):
    ans = 1
    while n:
        if n % 2:
            ans *= x
        x *= x
        n >>= 1
    return ans

"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""


n = input()[:-1]

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

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

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

Solution (Python):
import re

S = input()
if re.findall("s+$", S)== ["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):
word = input()

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

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

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

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

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

Solution (Python):
word = input()

word_len = len(word)

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

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

if s[-1] != 's':
    [print(m, end='') for m in s]
    print('s')
else:
    [print(m, end='') for m in s]
    print('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):
moji = input()
if moji[len(moji)-1] == 's':
  moji += 'es'
else :
  moji += 's'
print(moji)

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

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

Solution (Python):
def sep():
    return map(int,input().strip().split(" "))
def lis():
    return list(sep())


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

Solution (Python):
s = input()

if s[-1] != 's':
    s = s + 's'

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

print(s)

Solution (Python):
import sys
import math
from collections import defaultdict, deque, Counter
from copy import deepcopy
from bisect import bisect, bisect_right, bisect_left
from heapq import heapify, heappop, heappush
    
input = sys.stdin.readline
def RD(): return input().rstrip()
def F(): return float(input().rstrip())
def I(): return int(input().rstrip())
def MI(): return map(int, input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def LF(): return list(map(float,input().split()))
def Init(H, W, num): return [[num for i in range(W)] for j in range(H)]
    
    
def main():
    word = input().rstrip()
    len_w = len(word)
    if word[len_w-1]=="s":
        print(word+"es")
    else:
        print(word+"s") 
if __name__ == "__main__":
    main()

Solution (Python):
x = input()
if x[-1] in 'sS':
    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':
	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':
    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 math

import itertools
from collections import deque
from collections import Counter
import heapq


import bisect
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+str("es"))
else:
    print(s+str('s'))

Solution (Python):
str = input() 

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

print(str)

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

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

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


if __name__ == "__main__":
    main()

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

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

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

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

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

if S[-1] != "s":
    S.append("s")

else:
    S.append("es")

print(*S, sep="")

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

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

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

Solution (Python):

s = input()

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

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

Solution (Python):
s = input()

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

Solution (Python):
s = input()

s_list = list(s)

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

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

Solution (Python):
S=input()

if S.endswith('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()

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

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


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

Solution (Python):
s = input()

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

Solution (Python):
s=input()

def p(val):
    print(val)

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

Solution (Python):
if __name__ == '__main__':
    try:
        s = str(input())
        s.lower()
        if s[len(s)-1] != 's':
            s += 's'
            print(s)
        else:
            s += 'es'
            print(s)
    except Exception:
        pass

Solution (Python):
if __name__ == '__main__':
    try:
        s = str(input())
        s.lower()
        if s[len(s)-1] != 's':
            s += 's'
            print(s)
        else:
            s += 'es'
            print(s)
    except Exception:
        pass

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

Solution (Python):
S = input()

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

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

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

Solution (Python):
















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

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

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

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

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

Solution (Python):
import sys



from copy import *
from bisect import *	

from math import gcd
from itertools import permutations as prm,product
 
def eprint(*args):
    print(*args, file=sys.stderr)
zz=1
 

if zz:
	input=sys.stdin.readline
else:	
	sys.stdin=open('input.txt', 'r')
	sys.stdout=open('all.txt','w')
di=[[-1,0],[1,0],[0,1],[0,-1]]
def inc(d,c,x=1):
	d[c]=d[c]+x if c in d else x
def bo(i):
	return ord(i)-ord('A')	
def li():
	return [int(xx) for xx in input().split()]
def fli():
	return [float(x) for x in input().split()]	
def comp(a,b):
	if(a>b):
		return 2
	return 2 if a==b else 0		
def gi():	
	return [xx for xx in input().split()]
def fi():
	return int(input())
def pro(a): 
	return reduce(lambda a,b:a*b,a)		
def swap(a,i,j): 
	a[i],a[j]=a[j],a[i]	
def si():
	return list(input().rstrip())	
def mi():
	return 	map(int,input().split())			
def gh():
	sys.stdout.flush()
def isvalid(i,j):
	return 0<=i<n and 0<=j<m and a[i][j]!="."
def bo(i):
	return ord(i)-ord('a')	
def graph(n,m):
	for i in range(m):
		x,y=mi()
		a[x].append(y)
		a[y].append(x)

t=1
	

while t>0:
	t-=1
	s=input().rstrip()
	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[len(s)-1]=="s"):
  s = s + "es"
  print(s)
else:
  s = s + "s"
  print(s)

Solution (Python):

import sys

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
 
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 += '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
import os
import math
import bisect
import itertools
import collections
import heapq
import queue
import array







sys.setrecursionlimit(10000000)


def ii(): return int(sys.stdin.buffer.readline().rstrip())
def il(): return list(map(int, sys.stdin.buffer.readline().split()))
def fl(): return list(map(float, sys.stdin.buffer.readline().split()))
def iln(n): return [int(sys.stdin.buffer.readline().rstrip())
                    for _ in range(n)]


def iss(): return sys.stdin.buffer.readline().decode().rstrip()
def sl(): return list(map(str, sys.stdin.buffer.readline().decode().split()))
def isn(n): return [sys.stdin.buffer.readline().decode().rstrip()
                    for _ in range(n)]


def lcm(x, y): return (x * y) // math.gcd(x, y)


MOD = 10 ** 9 + 7
INF = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

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


if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
import time
startTimeProblem=time.time()

import fileinput, sys, itertools, functools
from math import *
from bisect import *
from heapq import *
from collections import *

def lcm(a, b):  
    return (a*b)/gcd(a, b)

class InputHelper:
    def __init__(self):
        self.myinput = fileinput.input()

    def isLocal(self):
        return not fileinput.isstdin()

    def int(self):
        return int(self.myinput.readline().rstrip())

    def ints(self):
        return [int(_) for _ in self.myinput.readline().rstrip().split()]

    def str(self):
        return self.myinput.readline().rstrip()

    def strs(self):
        return [_ for _ in self.myinput.readline().rstrip().split()]

class OutputHelper:
    def int(self, a):
        print(a)    

    def ints(self, a):  
        print(" ".join([str(_) for _ in a]))
    
    def intsNL(self, a):
        for _ in a:
            print(_)
    
    def str(self, s):
        print(s)

    def strs(self, s):
        print(" ".join([_ for _ in s]))

    def strsNL(self, s):
        for st in s:
            print(st)

class ListNode:
    def __init__(self, val):
        self.val = val
        self.next = None
        self.prev = None

In = InputHelper()
Out = OutputHelper()



S = In.str()

if S[-1]=="s":
    Out.str(S+"es")
else:
    Out.str(S+"s")



if len(sys.argv)>2 and sys.argv[2]=="TIMEIT":
    fin = (time.time()-startTimeProblem)*1000
    print("{:.2f}".format(fin) + "ms")

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

Solution (Python):

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    S=input()
    if S[-1]=="s":
        S+="es"
    else:
        S+="s"
        
    print(S)

main()

Solution (Python):
class Main:
    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":
    s += "e"
print(s + "s")

Solution (Python):














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

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

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

Solution (Python):
s = input()

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

print(ans)

Solution (Python):














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

Solution (Python):
N = input()

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

Solution (Python):
s = input()

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

print(ans)

Solution (Python):
s = input()

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

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

Solution (Python):
S = input()

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

Solution (Python):
S = input()
print('{}s'.format(S)) if S[-1] != 's' else print('{}es'.format(S))

Solution (Python):
s = input().strip()
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[len(s)-1] == 's':
    ans = s + 'es'
else:
    ans = s + 's'

print(ans)

Solution (Python):
import math
t = 1
for tc in range(t):
    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()
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):
s = input()
if s[-1] == "s":
  print(s + "es")
else:
  print(s + "s")

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def S(): return input().rstrip()
def LS(): return S().split()
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float("INF")


def solve():
    s = S()
    print(s + ["es", "s"][s[-1] != "s"])
    return



if __name__ == '__main__':
    solve()

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

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

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

Solution (Python):
from sys import stdin


def ans():
    _in = [_.rstrip() for _ in stdin.readlines()]
    S = _in[0]  
    
    if S[-1] == 's':
        S += 'es'
    else:
        S += 's'
    ans = S
    
    print(ans)


def main():
    _in = [_.rstrip() for _ in stdin.readlines()]
    S = list(_in[0])  
    
    ans = 0
    if S[-1] == 's':
        S[-1] += 'es'
    else:
        S[-1] += 's'
    ans = ''.join(S)
    
    print(ans)


if __name__ == "__main__":
    
    ans()

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

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

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

print(''.join(str(i) for i in s))

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

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

Solution (Python):
S = input()

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

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

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+'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 base64
import subprocess
import zlib


exe_bin = "c%1E9eQ+Da6<>Wgb`nQc5{D>BLqu?j1NdUaA8{Zql5II>;siIAgZW4nSvp(S$dZvx!46CtCXhiBLOo0eLZLGrm@;KL(}wA^!+$jxLdy)(&`u

open("./kyomu", 'wb').write(zlib.decompress(base64.b85decode(exe_bin)))
subprocess.run(["chmod +x ./kyomu"], shell=True)
subprocess.run(["./kyomu"], shell=True)

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

Solution (Python):
name = input()
length = len(name)

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

print(name)

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

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

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

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

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

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

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