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

Solution (Python):
if __name__ == "__main__":
    S = input()

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

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

if word[l-1]=="s":
  print("{}{}".format(word,"es"))
else:
  print("{}{}".format(word,"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":
    s = s + "s"

else:
    s = s + "es"


print( s )

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

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

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

if pal[-1] == 's':
    print(pal+"es")
else:
    print(pal+"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'):
  ans = ''
  for i in range(len(S)):
    ans += S[i]
  ans += 'e'
  ans += 's'
  print(ans)
else:
  ans = ''
  for i in range(len(S)):
    ans += S[i]
  ans += 's'
  print(ans)

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

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

Solution (Python):



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


if __name__ == '__main__':
    main()

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

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

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

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

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

Solution (Python):
s = input()

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

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

Solution (Python):
import math

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

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

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

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

Solution (Python):



import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

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

main()

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

Solution (Python):
s = input()

a = s[len(s) - 1]



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

print(s)

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

Solution (Python):
st = input()

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

Solution (Python):
s= input()
if s.endswith('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):
input_date = input()
input_length = len(input_date)
input_end = input_date[input_length - 1]

if (input_end == "s"):
  print(input_date + "es")
else:
  print(input_date + "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':
    answer = S + 'es'
else:
    answer = S + 's'
print(answer)

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

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

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

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

s = input()

if s[len(s)-2] == "s":
    ans = s.rstrip() + "es"
    print(ans)
else:
    ans = s.rstrip() + "s"
    print(ans)

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

print(a)

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

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

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

Solution (Python):
s = input()

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

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

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

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

print(str)

Solution (Python):
s = input()

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

Solution (Python):
n = input()

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

Solution (Python):
i = input()

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

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

print(ret)

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

Solution (Python):
d = input()

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

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

Solution (Python):
input_str = input()

if input_str.endswith("s"):
    print(f"{input_str}es")
else:
    print(f"{input_str}s")

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

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

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

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

 print( S + "es" )

else:

 print( S + "s" )

Solution (Python):
import sys
from sys import exit
from collections import deque
from copy import deepcopy
from bisect import bisect_left, bisect_right, insort_left, insort_right
from heapq import heapify, heappop, heappush
from itertools import product, permutations, combinations, combinations_with_replacement
from functools import reduce
from math import gcd, sin, cos, tan, asin, acos, atan, degrees, radians

sys.setrecursionlimit(10**6)
INF = 10**20
eps = 1.0e-20
MOD = 10**9+7

def lcm(x,y):
    return x*y//gcd(x,y)
def lgcd(l):
    return reduce(gcd,l)
def llcm(l):
    return reduce(lcm,l)
def powmod(n,i,mod=MOD):
    return pow(n,mod-1+i,mod) if i<0 else pow(n,i,mod)
def div2(x):
    return x.bit_length()
def div10(x):
    return len(str(x))-(x==0)
def intput():
    return int(input())
def mint():
    return map(int,input().split())
def lint():
    return list(map(int,input().split()))
def ilint():
    return int(input()), list(map(int,input().split()))
def judge(x, l=['Yes', 'No']):
    print(l[0] if x else l[1])
def lprint(l, sep='\n'):
    for x in l:
        print(x, end=sep)
def ston(c, c0='a'):
    return ord(c)-ord(c0)
def ntos(x, c0='a'):
    return chr(x+ord(c0))
class counter(dict):
    def __init__(self, *args):
        super().__init__(args)
    def add(self,x,d=1):
        self.setdefault(x,0)
        self[x] += d
    def list(self):
        l = []
        for k in self:
            l.extend([k]*self[k])
        return l
class comb():
    def __init__(self, n, mod=None):
        self.l = [1]
        self.n = n
        self.mod = mod
    def get(self,k):
        l,n,mod = self.l, self.n, self.mod
        if k<0 or n<k:
            return 0
        k = n-k if k>n//2 else k
        while len(l)<=k:
            i = len(l)
            l.append(l[i-1]*(n+1-i)//i if mod==None else (l[i-1]*(n+1-i)*powmod(i,-1,mod))%mod)
        return l[k]
def pf(x,mode='counter'):
    C = counter()
    p = 2
    while x>1:
        k = 0
        while x%p==0:
            x //= p
            k += 1
        if k>0:
            C.add(p,k)
        p = p+2-(p==2) if p*p<x else x
    if mode=='counter':
        return C
    S = set([1])
    for k in C:
        T = deepcopy(S)
        for x in T:
            for i in range(1,C[k]+1):
                S.add(x*(k**i))
    if mode=='set':
        return S
    if mode=='list':
        return sorted(list(S))



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

Solution (Python):


a = input()
b = len(a) -1
if (a[b] != "s"):
  c = a + "s"
if (a[b] == "s"):
  c = a + "es"
print(c)

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

Solution (Python):
chr = input("")
num = len(chr)

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

Solution (Python):
S = str(input())
if (S.endswith('s')) is 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):
import time
from math import ceil
from collections import defaultdict, deque


def A(s):
  if s[-1] == 's':
    return s + 'es'
  return s + 's'


def D(n):
  pass


def main():
  s = input()
  print(A(s))


if __name__ == '__main__':
  main()

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

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

Solution (Python):
string=input()
a=len(string)

if string[a-1]=='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()

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

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

Solution (Python):
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt
from copy import deepcopy
 


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

if __name__ == "__main__":
    main()

Solution (Python):
S = input()

N = S[-1]


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

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

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

Solution (Python):
a = input()

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

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

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

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

Solution (Python):
S = list(map(str, input()))

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

print("".join(S))

Solution (Python):
from __future__ import division, print_function

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

if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip

def solve():
     str1 = input()
     lst = [i for i in str1]
     if str1[-1] == 's':
        lst.append('es')
        print("".join(lst))
     else:
        lst.append('s')
        print("".join(lst))
        
           
def main():
    
    
    
    
        solve()
        


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


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()


if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)

input = lambda: sys.stdin.readline().rstrip("\r\n")



if __name__ == "__main__":
    main()

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

x = int(len(s))

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

Solution (Python):
s = input()


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

Solution (Python):
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()
print(f"{s}es" if s[-1] == "s" else f"{s}s")

Solution (Python):
user = input().strip()
print((user + "s", user + 'es')[user[-1] == 's'])

Solution (Python):
k = str(input())
a = list(k)
a.reverse()
if(a[0] == 's'):
    print(k + 'es')
else:
    print(k + 's')

Solution (Python):
list1 = []
list1  = list(input())


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

print(''.join(list1))

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

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

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

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

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

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline().strip()
last_alpha = input[-1]
if last_alpha == 's':
    print(input + 'es')
elif last_alpha == 'e':
    print(input + 's')
else:
    print(input + 's')

Solution (Python):
def change(N):
    if N[len(N)-1]=="s":
        N+="es"
    else:
        N+="s"
    return N

N=input()
print(change(N))

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

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

Solution (Python):
import math

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


def b():
    pass



def c():
    pass



def d():
    pass


a()

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

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

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

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

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

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


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

print(word_comp)

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):
a = input()
s = list(a)
if s[-1] != 's':
  s.append('s')
else:
  s.append('es')
    
print(''.join(s))

Solution (Python):
""" A
"""
import sys
import math
from functools import reduce
from bisect import bisect_left

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

def readInteger():
    return int(readString())

def readStringSet(n):
    return sys.stdin.readline().split(" ")[:n]

def readIntegerSet(n):
    return list(map(int, readStringSet(n)))

def readIntegerMatrix(n, m):
    return [lambda _: readIntegerSet(m) for _ in range(0, n)]

def main(S):
    return S + "es" if S.endswith("s") else S + "s"

if __name__ == "__main__":
    _S = readString().rstrip()

    print(main(_S))

Solution (Python):
"""
ABC179_A
"""
mojiretsu = str(input())
moji = mojiretsu[-1:]

if moji == "s":
    ans = mojiretsu + 'es'
else:
    ans = mojiretsu + 's'

print(ans)

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

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

Solution (Python):
s = input()

t = s[-1]

if t == 's':
    v = s + 'es'
else:
    v = s + 's'

print(v)

Solution (Python):
s = input()

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

Solution (Python):
S = input()

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

Solution (Python):
S = input()

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

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

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

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

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

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

Solution (Python):
S = input().split()
S = S[0]
S =  list(S)

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

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

Solution (Python):
s = input()

last = s[-1]

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

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

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

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


if __name__ == '__main__':
    main()

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

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

else:
    S.append('s')
    print(''.join(S))

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

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

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

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

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

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

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

s = input()
s = fukusu(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[len(s)-1]=="s":
  print("{}es".format(s))
else:
  print("{}s".format(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):
name = input()

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

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

Solution (Python):
S = input()

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

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

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

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

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

print(S)

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

Solution (Python):

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

main()

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

Solution (Python):
import math

from fractions import Fraction as frac

MOD = 1e9 + 7

def gcd(a, b):

    if b == 0:

        return a

    return gcd(b, a % b)

def lcm(a, b):

    return a * b // gcd(a, b)

def solve(case_no):

    s = str(input())

    if s[len(s) - 1] == 's':

    	print(s + "es")
    else:

    	print(s + 's')

t = 1



for i in range(1, t + 1):

    solve(i)

Solution (Python):
s =  input()
if s[-1].lower()=="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()
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()

t=s[-1:]

if(t=="s"):
    print(s+"es")
else:
    print(s+"s")

Solution (Python):
S = input()

a = len(S)
b = S[a-1]
c = S + "es"
d = S + "s"

if b == "s":
    print(c)

else:
    print(d)

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

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

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

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

Solution (Python):

    
    


import sys, os.path


    
    

sys.setrecursionlimit(10 ** 5)

def mod(): return 10**9+7
def i(): return sys.stdin.readline().strip()
def ii(): return int(sys.stdin.readline())
def li(): return list(sys.stdin.readline().strip())
def mii(): return map(int, sys.stdin.readline().split())
def lii(): return list(map(int, sys.stdin.readline().strip().split()))



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

for _ in range(1):
    solve()

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

S = readline().rstrip()

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

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

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

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

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