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

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

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

print(S)

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

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

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

Solution (Python):
from sys import stdin,stdout


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

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

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

Solution (Python):








    






mod = int(1e9+7)

INF = 1<<50

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

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

if __name__=='__main__':
    main()

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

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

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

Solution (Python):
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext

def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    s = s_input()

    print(s+ 'es' if s[-1] == 's' else 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 bisect, collections, copy, heapq, itertools, math, string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
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())

from collections import deque
from collections import Counter
import bisect
def main():
    S_ = S()
    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):
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':
    answer = S + 'es'
else:
    answer = S + 's'

print(answer)

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

if __name__ == '__main__':
    print(main())

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

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


def main():
    t = 1
    while t > 0:
        solve()
        t -= 1


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

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


main()

Solution (Python):
from __future__ import division, print_function

import os
import sys
from difflib import SequenceMatcher

 
    
    
from io import BytesIO, IOBase
from collections import Counter,deque
from heapq import heapify,heappush,heappop
from math import gcd,ceil,sqrt,log2,log
from itertools import accumulate,repeat,permutations,compress

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

def rl():
    return list(map(int,input().split()))
def arp(arr):
    return ' '.join([str(i) for i in arr])
    





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


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

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
from io import StringIO
import unittest





def yn(b):
    print("Yes" if b==1 else "No")
    return

def resolve():
    readline=sys.stdin.readline

    
    
    
    ss=readline().rstrip()
    if ss[-1]=="s":
        print(ss+"es")
    else:
        print(ss+"s")
    

    return

if 'doTest' not in globals():
    resolve()
    sys.exit()

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):
from __future__ import division, print_function
import bisect
import math
import heapq
import itertools
import sys
from collections import deque
from atexit import register
from collections import Counter
from functools import reduce
if sys.version_info[0] < 3:
    from io import BytesIO as stream
else:
    from io import StringIO as stream
 
 
if sys.version_info[0] < 3:
    class dict(dict):
        """dict() -> new empty dictionary"""
        def items(self):
            """D.items() -> a set-like object providing a view on D's items"""
            return dict.iteritems(self)
 
        def keys(self):
            """D.keys() -> a set-like object providing a view on D's keys"""
            return dict.iterkeys(self)
 
        def values(self):
            """D.values() -> an object providing a view on D's values"""
            return dict.itervalues(self)
 
    input = raw_input
    range = xrange
 
    filter = itertools.ifilter
    map = itertools.imap
    zip = itertools.izip
 
 
def sync_with_stdio(sync=True):
    """Set whether the standard Python streams are allowed to buffer their I/O.
 
    Args:
        sync (bool, optional): The new synchronization setting.
 
    """
    global input, flush
 
    if sync:
        flush = sys.stdout.flush
    else:
        sys.stdin = stream(sys.stdin.read())
        input = lambda: sys.stdin.readline().rstrip('\r\n')
 
        sys.stdout = stream()
        register(lambda: sys.__stdout__.write(sys.stdout.getvalue()))

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

if __name__ == '__main__':
    sync_with_stdio(False)
    main()

Solution (Python):
A = input()

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

Solution (Python):

import sys, re
from decimal import *
from collections import deque, defaultdict, Counter, OrderedDict
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, floor, trunc, log
from heapq import heappush, heappop, heapify, nlargest, nsmallest
def STR(): return list(input())
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def list2d(a, b, c): return [[c] * b for i in range(a)]
def sortListWithIndex(listOfTuples, idx):   return (sorted(listOfTuples, key=lambda x: x[idx]))
def sortDictWithVal(passedDic):
    temp = sorted(passedDic.items(), key=lambda kv: (kv[1], kv[0]))
    toret = {}
    for tup in temp:
        toret[tup[0]] = tup[1]
    return toret
def sortDictWithKey(passedDic):
    return dict(OrderedDict(sorted(passedDic.items())))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

x = input()

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

Solution (Python):
s = input()

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

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

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





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

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

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

Solution (Python):
"""MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMWO:,'..'xXWWMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM
MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMO. .:kOo.,kNMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM
MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMO. .lNWWo..lXMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM
MNOxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxMMMMWKxoloxKWNc  .:xxd;  ,dxxxkXMXkxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxMM
MKc''''''''''''''''.  ..'''''.   .''''.  .''MMMWx..,:. .xXo''.  .''.  ..'';kMk;'''''.  .'.''.  .''''''.  ..''.   .''MM
MWNXNNNNNNNNNNNNNNNO' ;KNNNNNKo. cKNNNd. lXNMMMK; ,0Wx. :NWXXl .dNNO' ;KNNNWMWNNNNNXc .kNNNNx. cXNNNNNO' ;KNN0; 'ONNMM
MMMMMMMMMMMMMMMMMWM0' :NMMMMWMX: .OMWWx. oWMMMMWx. ';. .dNMWWo .xMM0' :NWWMMMMMMMMWWl .OMMMWk. lWWMMWM0' ;XMMX: ,KMMMM
MMMMMMWMWkccccccccc;. :NMWNNNKd. :XMMWx. oWMMMWKo. .',. .,ldx; .dMM0' :NMMMMMMMNNWMWl .OMMMWk. lWMMMMM0' ;XMMX: ,0MMMM
MMWXKNWMWxcc,. .;cc;. :XMk,''..'lKWMMWx. oWMNx:. .lONNKxl.     .xMM0' :NMMMMMM0:,oKO' ,KMMMMk. lWWNkoc,. .;::;. ,KMMMM
MMXc.lXMMWWWNd..xWM0' :NM0;  ;kXWMMMWNl  oWMK:.;xXWWMWXx:. ,c' .dMM0' :NMMMMMMKc. ...;kWMMMMk. lWWc .:;. .clc:. ,KMMMM
MWWx. lXMWMMMK, lWM0' :NMMNx'.,ldxxoc'   oWMWNKNWWWN0o' .:kNWo .dMM0' :NMMMMMMMNO;  ,OWWWMMMk. lWM' lXx. lNMMX: ,KMMMM
MMMWk'.,xKNX0c..kWM0' :NMMMMNkl;,'',:l:  oWMMMMMWMWO' 'l0WMWWo .xMM0' :NMMMMMMMMMNd. .oXWMMMk. lWMd.....;0WMMX: ,KMMMM
MMMMWKo'...'..:kWMM0' :NMMMMMMMWWNNWWWx. oWMMMMMMMMWOxXWMWMWWo .xMM0' :NMMMMMMMMMMMKl. ,kNMMk. lWMWKkxx0NMWMMX: ,KMMMM
MMMMMMMN0kxk0XNWMMWKl;xNMMMMMMMMMMMMWM0c;kWMMMMMMMMMMMWWMMMMWk;:OMMXl,dNMMMMMMMMMMMMWO; .dNM0c;kWWMMMMMMMMMMMNd,oXMMMM
MMMMMMMMWWMWMMMMMMMMMWWMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMWWMMWWMMWMMMMMMMMMMMMMMNkxKWMMWWMMMMMMMMMMMMMMWMMWMMMMM
MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM"""





import math;   		from collections import *
import sys;   		from functools import reduce
import time;   		from itertools import groupby




def get_ints()      : return map(int, input().strip().split())
def get_list()      : return list(get_ints())
def get_string()    : return list(input().strip().split())
def printxsp(*args) : return print(*args, end="")
def printsp(*args)  : return print(*args, end=" ")


DIRECTIONS = [(+0, +1), (+0, -1), (+1, +0), (+1, -1)] 
NEIGHBOURS = [(-1, -1), (-1, +0), (-1, +1), (+0, -1),\
              (+1, +1), (+1, +0), (+1, -1), (+0, +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()
print(s + ('s' if s[-1] != 's' else 'es'))

Solution (Python):
S = input()

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

Solution (Python):
s = input()
s = list(s)
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':
    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
sys.setrecursionlimit(10 ** 7)
MIN = -10 ** 9
MOD = 10 ** 9 + 7
INF = float("inf")
IINF = 10 ** 18

def solve():
    s = str(stdin.readline().rstrip())
    
    
    
    
    
    
    if s[-1] != "s":
        print(s + "s")
    else:
        print(s + "es")

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

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

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

print(s)

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

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



if __name__=="__main__":
    solve()

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

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

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

Solution (Python):
S = input()

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

Solution (Python):








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


if __name__ == '__main__':
    S = input()
    
    
    
    
    
    solve(S)

Solution (Python):
import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7

INF = 10**18
eps = 10**-7

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':
    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 = list(input())
if S[-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':
    s+='es'

else:
    s+='s'


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

Solution (Python):
s=raw_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()

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

Solution (Python):
a = input()

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

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

resolve()

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):
from typing import List, Any


def read_int() -> int:
    return int(input().strip())


def read_ints() -> List[int]:
    return list(map(int, input().strip().split(' ')))


def solve() -> Any:
    s = input().strip()
    if s.endswith('s'):
        return s+'es'
    return s+'s'


if __name__ == '__main__':
    print(solve())

Solution (Python):

"""
Created on Sat Sep 19 20:16:30 2020

@author: liang
"""
 

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

Solution (Python):
s = input().rstrip()

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

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

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

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

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

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

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

Solution (Python):

import bisect
import heapq
import math
import random
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from fractions import Fraction
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations, accumulate
from operator import add, mul, sub, itemgetter, attrgetter


import sys


readline = sys.stdin.readline

INF = 1 << 60


def read_int():
    return int(readline())


def read_int_n():
    return list(map(int, readline().split()))


def read_float():
    return float(readline())


def read_float_n():
    return list(map(float, readline().split()))


def read_str():
    return readline().strip()


def read_str_n():
    return readline().strip().split()


def ep(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.perf_counter()
        ret = f(*args, **kwargs)
        e = time.perf_counter()

        ep(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(S):
    return S + ('es' if S[-1] == 's' else 's')


def main():
    S = read_str()
    print(slv(S))


if __name__ == '__main__':
    main()

Solution (Python):
from functools import reduce
from fractions import gcd
import math
import bisect
import itertools
import sys
input = sys.stdin.readline
INF = float("inf")



def main():
    S = input()[:-1]

    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):
def main():
    examA()

def examA():
    S = SI()
    if S[-1]=="s":
        ans = S+"es"
    else:
        ans = S+"s"
    print(ans)
    return

def examB():
    ans = 0
    print(ans)
    return

def examC():
    ans = 0
    print(ans)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    ans = 0
    print(ans)
    return

def examF():
    ans = 0
    print(ans)
    return

from decimal import getcontext,Decimal as dec
import sys,bisect,itertools,heapq,math,random
from copy import deepcopy
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def I(): return int(input())
def LI(): return list(map(int,sys.stdin.readline().split()))
def DI(): return dec(input())
def LDI(): return list(map(dec,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,alphabet_convert,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 1<<31
_ep = dec("0.000000000001")
alphabet = [chr(ord('a') + i) for i in range(26)]
alphabet_convert = {chr(ord('a') + i): i for i in range(26)}

getcontext().prec = 28

sys.setrecursionlimit(10**7)

if __name__ == '__main__':
    main()

"""
142
12 9 1445 0 1
asd dfg hj o o
aidn
"""

Solution (Python):
s = input()

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

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

Solution (Python):
import math
import collections
from sys import exit
from itertools import product

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

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

S = input().rstrip()

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

Solution (Python):

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

if __name__ == "__main__":
    resolve()

Solution (Python):
import sys, math
import io, os

from bisect import bisect_left as bl, bisect_right as br, insort
from heapq import heapify, heappush, heappop
from collections import defaultdict as dd, deque, Counter

def data(): return sys.stdin.readline().strip()
def mdata(): return list(map(int, data().split()))
def outl(var): sys.stdout.write(' '.join(map(str, var)) + '\n')
def out(var): sys.stdout.write(str(var) + '\n')
from decimal import Decimal


mod = int(1e9) + 7
INF=float('inf')


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

Solution (Python):
s = input()

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

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

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