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
sys.setrecursionlimit(1000000000)
import math
from math import gcd
def lcm(a, b): return a * b // gcd(a, b)
from itertools import count, permutations, combinations, chain, product
from functools import lru_cache
from collections import deque, defaultdict
from operator import itemgetter
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok

def get_inv(n, modp):
    return pow(n, modp-2, modp)

def factorials_list(n, modp):    
    fs = [1]
    for i in range(1, n+1):
        fs.append(fs[-1] * i % modp)
    return fs

def invs_list(n, fs, modp):     
    invs = [get_inv(fs[-1], modp)]
    for i in range(n, 1-1, -1):
        invs.append(invs[-1] * i % modp)
    invs.reverse()
    return invs

def comb(n, k, modp):
    num = 1
    for i in range(n, n-k, -1):
        num = num * i % modp
    den = 1
    for i in range(2, k+1):
        den = den * i % modp
    return num * get_inv(den, modp) % modp

def comb_from_list(n, k, modp, fs, invs):
    return fs[n] * invs[n-k] * invs[k] % modp



class UnionFindEx:
    def __init__(self, size):
        
        self.roots = [-1] * size
    def getRootID(self, i):
        r = self.roots[i]
        if r < 0:   
            return i
        else:
            r = self.getRootID(r)
            self.roots[i] = r
            return r
    def getGroupSize(self, i):
        return -self.roots[self.getRootID(i)]
    def connect(self, i, j):
        r1, r2 = self.getRootID(i), self.getRootID(j)
        if r1 == r2:
            return False
        if self.getGroupSize(r1) < self.getGroupSize(r2):
            r1, r2 = r2, r1
        self.roots[r1] += self.roots[r2]    
        self.roots[r2] = r1
        return True

Yes = 'Yes'
No = 'No'

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






main()

Solution (Python):
S = input()
MOD = 1000000007
count = 0
ans = 0

moji = len(S)

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

Solution (Python):
S = input().strip(); 

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

Solution (Python):
test = input()

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

print(test)

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

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

Solution (Python):

import sys


def solve(S: str):

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

print(s,end="es" if s.endswith("s") else "s")

Solution (Python):
b=input()
a=list(b)
if a[-1]=="s":
  print("{}es".format(b))
else:
  print("{}s".format(b))

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

Solution (Python):
S = input()

ans = ''
if S[len(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):
from sys import stdin
def ip(): return [int(i) for i in stdin.readline().split()]
def sp(): return [str(i) for i in stdin.readline().split()]


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

Solution (Python):
s = str(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
def input():
    return sys.stdin.readline()[:-1]
S=input()

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

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

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

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

s = input()
s_plural = createPlural(s)
print(s_plural)

Solution (Python):
s = str(input())
t = s[-1]

if t == "s":
    s = s + "es"
else:
    s = s + "s"

print(s)

Solution (Python):
s = input().lower()
if s[-1] == 's':
  print(str(s)+"es")
elif s[-1] != 's':
  print(str(s)+"s")

Solution (Python):
s = input()

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

Solution (Python):
S=str(input())
for i in range(1000):
  try:
    k=S[i]
  except IndexError:
    break
if k=='s':
  S+='es'
else:
  S+='s'
    
print (S)

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

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

Solution (Python):
txt = str(input())
matu = txt[-1]

if matu == "s":
    print(txt + "es")
else:
    print(txt + "s")

Solution (Python):
S = input()

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

print(S)

Solution (Python):
x=input()

if x[-1]=='s':

  x+="es"

else:

  x+="s"

  

print(x)

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

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

print(ans)

Solution (Python):


S = input()

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

print(S)

Solution (Python):
s= input()
S = list(s)
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("{}{}".format(S, 's'))
else:
  print("{}{}".format(S, 'es'))

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

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

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

Solution (Python):


s= input()


    





    
    

n = len(s)
ss =('s')
ess =('es')


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

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()





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+"s"
else:
  S.rstrip()
  S=S+"es"
print("".join(map(str,S)))

Solution (Python):
_string = input()
_leng = len(_string)
_last = _leng - 1

if _string[_last] == 's':
  print(_string + "es")
else:
  print(_string + "s")

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

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

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

Solution (Python):

import sys
import math
import numpy as np
import itertools


m = list(input())


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

for i in m:
    print(i,end='')
print("")

Solution (Python):

x=list(input())
if x[-1]=='s':
    x.append('e')
    x.append('s')
else:
    x.append('s')

print(''.join(x))

Solution (Python):
if __name__ == "__main__":
    S = input()
    last = S[-1:]
    if 's' == last:
        mul = S + "es"
    else :
        mul = S + "s"
    
    print(mul)

Solution (Python):


"""
https://atcoder.jp/contests/abc179/tasks/abc179_a
A - Plural Form .
"""

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

    return


if __name__ == "__main__":
    s = input()
    solve(s)

Solution (Python):
noun = input()

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

print(noun)

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

Solution (Python):
if __name__=="__main__":
    S = list(input())
    length = len(S)
    if S[length-1]=='s':
        S += 'es'
    else:
        S += 's'
    print(''.join(S))

Solution (Python):
S=input()

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

Solution (Python):
l=list(str(input()))
if l[len(l)-1]=='s':
    l[len(l)-1]='ses'
else:
    l[len(l)-1]+='s'
o=''
for i in l:
    o+=i
print(o)

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

else:
  print(s+'s')

Solution (Python):
S = input()

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

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

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

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

Solution (Python):
import sys

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

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

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

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

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

s = str(input())
print(addPluralForm(s))

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

if __name__ == '__main__':
    main()

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

Solution (Python):
x = input()

if x[len(x) - 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 = input()

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

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

Solution (Python):
text = input()

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

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

Solution (Python):
s = input()

x = len(s)

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

else:
    s += "s"

print(s)

Solution (Python):

s = input()

def main():
    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":
    plural = S + "es"
else:
    plural = S + "s"

print(plural)

Solution (Python):
S = input()

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

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

Solution (Python):
S = input()
N = len(S)
if S[N-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()

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

Solution (Python):
i = input()

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

Solution (Python):
a = str(input())
a_la = a[-1]
if a_la == 's':
    ans = a + 'es'
else:
    ans = a + '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, end="")
    print("es")
else:
    print(s, end="")
    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()
last_s = s[-1:]
if last_s == "s":
    print(s + "es")
else:
    print(s + "s")

Solution (Python):
s = input()
plural = ["s","o","ch","sh","ss"] 
if s[-1] in plural:
    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[len(S)-1]=='s':
    S+='es'
else:
    S+='s'
print(S)

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

Solution (Python):

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

Solution (Python):
str = input()

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

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

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

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

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

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

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

Solution (Python):
S=str(input())
S=list(map(str,S))
if S[-1]=='s':
  S.append('es')
else:
  S.append('s')
for i in range(len(S)):
  print(S[i],end='')

Solution (Python):


S = input()


Max = len(S)


if S[Max-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):
s = input()

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

print(s)

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

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

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

Solution (Python):
s = input()

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

Solution (Python):
s = input()
l = len(s) - 1
if s[l] == 's':
    s += 'es'
elif s[l] != 's':
    s += 's'

print(s)

Solution (Python):
S=input()
S_re=list(reversed(S))
if S[len(S)-1]!="s":
    print(S,end="")
    print("s")
else:
    print(S,end="")
    print("es")

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

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

Solution (Python):
s  = str(input())
l = len(s)
if s[l-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 = str(input())
a = []
for n in list(s):
    a.append(n)
b = len(a)
if a[b-1] == "s":
    c = "es"
else:
    c = "s"
print(s + c)

Solution (Python):
x = input()

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

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

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

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

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):
import sys
input = sys.stdin.readline

S = input().strip()

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

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

if __name__ == "__main__":
    solve()

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

    j = S[len(S)-1]

    if j=="s":
        ans = S + "es"
    else:
        ans = S + "s"

    print(ans)    

if __name__ == "__main__":
    solve()

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")

print("".join(S))

Solution (Python):

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

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

Solution (Python):
S = str(input().lower())
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):
noun = input()

if noun[len(noun)-1] != 's':
  print(noun + 's')
elif noun[len(noun)-1] == 's':
  noun[len(noun)-2]
  print(noun + 'es')

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

print(S)

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

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

print(S)

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

if x[len(x)-1] == "s":
    x = x + "es"
else:
    x = 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):
T=list(input())
if T[len(T)-1]!='s':
   T.append('s')
else:
  T.append('es')
U=''.join(T)
print(U)

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

Solution (Python):
S = str(input())
slis = list(S)
if slis.pop(-1) == "s":
    print("{0}es".format(S))
else:
    print("{0}s".format(S))

Solution (Python):
word = input()

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

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

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

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

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

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

Solution (Python):
s = input()

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

print(s)

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

Solution (Python):


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

    print(s)


if __name__ == "__main__":
    main()

Solution (Python):
import sys
s = sys.stdin.readline().rstrip("\n")
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 + '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):
s=input()
t=list(s)

if t[-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':
    ans=S+'es'
else:
    ans=S+'s'
print(ans)

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

Solution (Python):
word = input()

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

print(word)

Solution (Python):
s = list(input())
k = ''
if s[-1] != 's' :
    s.append('s')
else :
    s.append('es')
for i in s :
	k += i
print(k)

Solution (Python):
w = input()

if w.endswith('s'):
  w = w + "es"
  print(w)
elif not(w.endswith('s')):
  w = w + "s"
  print(w)

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

Solution (Python):


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

Solution (Python):
n=input()
k=len(n)
if n[k-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()
s="s"
es="es"

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

Solution (Python):

import sys




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

    print(s)


main()

Solution (Python):
s = input()

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

Solution (Python):
'''
Name: Devansh
Username: singhdevansh
Github: https://github.com/Devansh3712
'''

import os
import sys
import math
from itertools import *
from io import BytesIO, IOBase
from collections import *


BUFSIZE = 8192

class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")

sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)



mod=(10**9)+7
pi=3.14159265358979323846264338327950

def i1():	
	return int(sys.stdin.readline())

def sf():	
	return sys.stdin.readline()

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

def arr():	
	return list(map(int,sys.stdin.readline().split()))

def pf(ans): 
	return sys.stdout.write(str(ans)+"\n")

def gcd(a,b):
	if a==0:
		return b
	elif b==0:
		return a
	if a>b:
		return gcd(a%b,b)
	else:
		return gcd(a,b%a)

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




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

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

Solution (Python):
from itertools import groupby
class Combination:
    def __init__(self, n, mod):
        self.n = n
        self.mod = mod
        self.fac = [1 for i in range(self.n + 1)]
        self.finv = [1 for i in range(self.n + 1)]
        for i in range(2, self.n+1):
            self.fac[i] = (self.fac[i - 1] * i) % self.mod
            self.finv[i] = (self.finv[i - 1] * pow(i, -1, self.mod)) % self.mod

    def comb(self, n, m):
        return self.fac[n] * (self.finv[n - m] * self.finv[m] % self.mod) % self.mod
        
def iparse():
    return list(map(int, input().split()))





def runLengthEncode(S: str):
    grouped = groupby(S)
    res = []
    for k, v in grouped:
        res.append((k, str(len(list(v)))))
    return res


if __name__ == "__main__":
    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 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):

import sys


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

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


if __name__ == "__main__":
    main()

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":
    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):
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()

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()
length = len(S)
if S[length-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.endswith('s') == True:
    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.endswith('s'):
    print(f'{S}es')
else:
    print(f'{S}s')

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

Solution (Python):
item = input()

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

print(item)