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

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




if __name__ == "__main__":
    main()

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

Solution (Python):
a = input()

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

Solution (Python):
s = input()

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

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

Solution (Python):


import os,sys
from io import BytesIO, IOBase

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

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)
input = lambda: sys.stdin.readline().rstrip("\r\n")

if __name__ == '__main__':
    main()

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

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


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


if __name__ == '__main__':
    resolve()

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

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

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


if __name__ == '__main__':
    main()

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):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil,pi,factorial
    from operator import itemgetter
    def I(): return int(input())
    def MI(): return map(int, input().split())
    def LI(): return list(map(int, input().split()))
    def LI2(): return [int(input()) for i in range(n)]
    def MXI(): return [[LI()]for i in range(n)]
    def SI(): return input().rstrip()
    def printns(x): print('\n'.join(x))
    def printni(x): print('\n'.join(list(map(str,x))))
    inf = 10**17
    mod = 10**9 + 7

    s=SI()
    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+'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):
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

in_n = lambda: int(readline())
in_nn = lambda: map(int, readline().split())
in_s = lambda: readline().rstrip().decode('utf-8')
in_nl = lambda: list(map(int, readline().split()))
in_nl2 = lambda H: [in_nl() for _ in range(H)]
in_map = lambda: [s == ord('.') for s in readline() if s != ord('\n')]
in_map2 = lambda H: [in_map() for _ in range(H)]
in_all = lambda: map(int, read().split())


def main():

    s = in_s()

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

    print(s)


if __name__ == '__main__':
    main()

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

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

Solution (Python):

S=input()

if S[-1]=="s":
    print(S+"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 bisect,collections,copy,itertools,math,string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def main():




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


main()

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

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

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


if __name__ == '__main__':
    main()

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

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


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

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

Solution (Python):

def main():
    s = input()

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


if __name__ == '__main__':
    main()

Solution (Python):
S = input()

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

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

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

Solution (Python):
x = input()

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

Solution (Python):
import bisect, copy, heapq, math, sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
    return sys.stdin.readline()[:-1]
def ruiseki(lst):
    return [0]+list(accumulate(lst))
def celi(a,b):
    return -(-a//b)
sys.setrecursionlimit(5000000)
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]

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':
  print(''.join(s+['e', 's']))
else:
  print(''.join(s+['s']))

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

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

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

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

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

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

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

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

Solution (Python):
S = input()

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

Solution (Python):
import sys
input = sys.stdin.readline
S = input()[: -1]
if S[-1] == "s": print(S + "es")
else: print(S + "s")

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

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

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

Solution (Python):
import sys

sys.setrecursionlimit(500005)
stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().strip()

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

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

Solution (Python):
s=input()

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

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

else:
    print(S+'s')

Solution (Python):
s = input()

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

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

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

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

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

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

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

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

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

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

Solution (Python):


import sys
iim = lambda: map(int, sys.stdin.readline().rstrip().split())

def resolve():
    s = input()

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

if __name__ == "__main__":
    resolve()

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

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

Solution (Python):


import sys
stdin = sys.stdin

def ns(): return stdin.readline().rstrip()
def ni(): return int(ns())
def na(): return list(map(int, stdin.readline().split()))

def main():
    s = ns()
    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):
i=input()
if i[-1] == 's':
  print(i + 'es')
else:
  print(i + 's')

Solution (Python):
s = input ()

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

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

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 itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() 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)]

sys.setrecursionlimit(1000000)
mod = 1000000007

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

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

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

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

print(s)

Solution (Python):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    S = input()

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


if __name__ == '__main__':
    main()

Solution (Python):
from sys import stdin
from sys import setrecursionlimit
setrecursionlimit(10 ** 7)

s = input()

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

Solution (Python):


import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

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

Solution (Python):
s = input()

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

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

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

print(s)

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

Solution (Python):
S=input()

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

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

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

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

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

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

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

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

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

Solution (Python):
S = input()

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

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

Solution (Python):
from sys import stdin
rs = lambda : stdin.readline().strip()
ri = lambda : int(rs())
ril = lambda : list(map(int, rs().split()))

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


if __name__ == '__main__':
    main()

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

Solution (Python):
s = input()

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

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

Solution (Python):
S = input()

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
s=input()

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

Solution (Python):
FAST_IO = 0
if FAST_IO:
    import io, sys, atexit
    rr = iter(sys.stdin.read().splitlines()).next
    sys.stdout = _OUTPUT_BUFFER = io.BytesIO()

    @atexit.register
    def write():
        sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())
else:
    rr = raw_input
rri = lambda: int(rr())
rrm = lambda: map(int, rr().split())
rrmm = lambda n: [rrm() for _ in xrange(n)]


MOD = 10**9 + 7
YES, NO, IMP = "YES", "NO", "IMPOSSIBLE"
from collections import defaultdict as ddic


def solve(S):
    if S.endswith('s'):
        return S + 'es'
    return S + 's'

print solve(rr())

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

Solution (Python):
import sys
import itertools

import time
import math
from heapq import heappop, heappush
from collections import defaultdict
from collections import Counter
from collections import deque
from itertools import permutations
sys.setrecursionlimit(10 ** 7)
 
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines


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 += 'e'
S += 's'
print(S)

Solution (Python):


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

Solution (Python):
from sys import stdin, setrecursionlimit
from collections import Counter, deque, defaultdict
from math import floor, ceil
from bisect import bisect_left
from itertools import combinations
setrecursionlimit(100000)

INF = int(1e10)
MOD = int(1e9 + 7)

def main():
    from builtins import int, map
    s = input()
    if s[-1] != 's':
        print(s + "s")
    else:
        print(s + "es")

if __name__ == '__main__':
    main()

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

Solution (Python):



from math import gcd
from itertools import combinations,permutations,accumulate, product 

from collections import deque,defaultdict,Counter
import decimal
import re
import math
import bisect
import heapq














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


INF = float('inf')
from sys import stdin
readline = stdin.readline
def readInts():
  return list(map(int,readline().split()))
def readTuples():
    return tuple(map(int,readline().split()))
def I():
    return int(readline())
S = input()
print(S + 's' if S[-1] != 's' else S + 'es')

Solution (Python):
import sys, math, re
from functools import lru_cache
from collections import deque
sys.setrecursionlimit(10**9)
MOD = 10**9+7

def input():
    return sys.stdin.readline()[:-1]

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

def ii():
    return int(input())

def i2(n):
    tmp = [list(mi()) for i in range(n)]
    return [list(i) for i in zip(*tmp)]

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

import os
import sys
from io import BytesIO, IOBase

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)
input = lambda: sys.stdin.readline().rstrip("\r\n")


from math import gcd, ceil

def pre(s):
    n = len(s)
    pi = [0] * n
    for i in range(1, n):
        j = pi[i - 1]
        while j and s[i] != s[j]:
            j = pi[j - 1]
        if s[i] == s[j]:
            j += 1
        pi[i] = j
    return pi


def prod(a):
    ans = 1
    for each in a:
        ans = (ans * each)
    return ans

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


def binary(x, length=16):
    y = bin(x)[2:]
    return y if len(y) >= length else "0" * (length - len(y)) + y


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