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


if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
import sys
from math import ceil as C, floor as F, sqrt, gcd as G
from collections import defaultdict as D, Counter as CNT
from functools import reduce as R
import heapq as HQ

class Heap:
  def __init__(self, data, reverse=False):
    self.reverse = -1 if reverse else 1
    self.data = [self.reverse * d for d in data]
    HQ.heapify(self.data)
  def push(self, x): return HQ.heappush(self.data, self.reverse * x)
  def pop(self): return self.reverse * HQ.heappop(self.data) 

ALP = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
alp = 'abcdefghijklmnopqrstuvwxyz'
def _X(): return sys.stdin.readline().rstrip().split(' ')
def _S(ss): return tuple(ss) if len(ss) > 1 else ss[0]
def S(): return _S(_X())
def Ss(): return list(S())
def _I(ss): return tuple([int(s) for s in ss]) if isinstance(ss, tuple) else int(ss)
def I(): return _I(S())
def _Is(ss): return list(ss) if isinstance(ss, tuple) else [ss]
def Is(): return _Is(I())

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

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

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

Solution (Python):


from sys import stdin, stdout
from math import *

testing = True

def tp(s="\n"):
	if testing:
		stdout.write(s)

def main():
	s = stdin.readline().strip()
	if s[-1] != "s":
		s += "s"
	else:
		s += "es"
	stdout.write("{0}\n".format(s))
	

main()

Solution (Python):
import itertools

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

Solution (Python):
S = input()

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

print(S)

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

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

Solution (Python):
ss = str(input())
myend = len(ss) -1

if ss[myend] == 's':
    print(ss+'es')
else:
    print(ss+'s')

Solution (Python):



import collections
import sys
import copy
import re
import math


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


if __name__ == '__main__':
    main()

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

Solution (Python):

import sys
sys.setrecursionlimit(10**6)

s = str(input())

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

Solution (Python):
A = input()

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

print(A)

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

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

print(ans)

Solution (Python):
S = input()

if S.endswith('s'):
  S = S + 'es'
else:
  S = S + 's'

print(S)

Solution (Python):


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

print(ans)

Solution (Python):

import sys


input = sys.stdin.readline


def ST():
    return input().rstrip()


def I():
    return int(input())


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


def LI():
    return list(MI())


S = ST()

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

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

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

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

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

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

print(S)

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

main()

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

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



import sys
from collections import defaultdict, deque
from heapq import heappush, heappop
import math
import bisect
input = sys.stdin.readline




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

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

Solution (Python):
import sys

def input(): return sys.stdin.readline().rstrip("\r\n")
def List(): return list(map(int, input().split()))
def Num(): return int(input())


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

Solution (Python):
s = input().strip()
if s.endswith("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()

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

Solution (Python):
S = input()

s = 's' if S[-1] != 's' else 'es'

print(S + s)

Solution (Python):
import sys

input_ = sys.stdin.readline
S = input_().strip()

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

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

Solution (Python):
a = input()

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

Solution (Python):
s = input()

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

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

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

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

Solution (Python):
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

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

if __name__ == '__main__':
    resolve()

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

    s = input().rstrip()

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


if __name__ == "__main__":
    resolve()

Solution (Python):
from collections import Counter
import math
import statistics
import itertools
a=input()












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

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

Solution (Python):
s = 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
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

s = input().strip()

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

Solution (Python):

import sys
import bisect as bi
import math
from collections import defaultdict as dd
import heapq
import itertools

input=sys.stdin.readline
import random



mod=10**9+7
def cin():
    return map(int,sin().split())
def ain():            
    return list(map(int,sin().split()))
def sin():
    return input()
def inin():
    return int(input())

    
for _ in range(1):
    s=sin().strip()
    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):
a = {'a','e','i','o','u'}
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):
word = input()
if word[len(word)-1] != 's':
    print(word+'s')
else:
    print(word+'es')

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

Solution (Python):


S = input()


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


print(ans)

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

Solution (Python):
s = input()

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

Solution (Python):
import sys
sys.setrecursionlimit(10**7)

def input(): return sys.stdin.readline()[:-1]
mod = 10**9 + 7
def readInt():return int(input())
def readIntList():return list(map(int,input().split()))
def readStringList():return list(input())
def readStringListWithSpace():return list(input().split())
def readString():return input()

from itertools import accumulate
 
def execute():
    s = readStringList()
    if s[-1] == 's':
        s += ['e','s']
    else:
        s.append('s')
    print("".join(s))
    
 
if __name__ == "__main__":
    execute()

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

Solution (Python):
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]

def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

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


print(main())

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

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

Solution (Python):
T=list(str(input()))

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

Solution (Python):
v = input()
if v.endswith('s'):
    print(f'{v}es')
else:
    print(f'{v}s')

Solution (Python):
x = input()
if 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):
S = input()
a = list(S)
if a[-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):
i = input()

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

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

print(ans)

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

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

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

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

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

Solution (Python):
import math
import collections
import bisect
from collections import deque
from copy import copy, deepcopy
import time

import numpy as np
import numba
from numba import njit, b1, i4, i8, f8
from numba import jit


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

if __name__ == '__main__':
    main()

Solution (Python):
import sys
S=sys.stdin.readline().strip()
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[len(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().rstrip()

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()
n=len(s)
a=s[n-1]
if a=="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 = input()
l = list(s)
if l[-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().strip()
print(s+["s", "es"][s[-1] == "s"])

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

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

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

Solution (Python):
S = input()

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

Solution (Python):
s = input()

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

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

Solution (Python):
s = input()

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

Solution (Python):
s = input()

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

print(s)

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

Solution (Python):







from math import *


def _in():
    return [int(x) for x in input().split(' ')]


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

Solution (Python):
a=input()

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

Solution (Python):


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

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

Solution (Python):
S = input()

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

Solution (Python):
import sys
sys.setrecursionlimit(10**6)


def main(input, print):
    s = input().strip()

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


if __name__ == '__main__':
    main(sys.stdin.readline, print)

Solution (Python):

if __name__ == '__main__':
    s = input()

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

Solution (Python):
S = input()

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

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

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

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

Solution (Python):
S=input()
tmp = list(S)[-1]

if tmp=="s":
    print(S+"es")
else:
    print(S+"s")

Solution (Python):



def solve(*args: str) -> str:
    s = args[0]

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


if __name__ == "__main__":
    print(solve(*(open(0).read().splitlines())))

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

Solution (Python):
S = input()
a = len(S)
if S[a - 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')
t = ''
for i in s:
    t += i
print(t)

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

last = s[-1]
if last == '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
sys.setrecursionlimit(10 ** 9)

def int1(x): return int(x) - 1
def II(): return int(input())
def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def MS(): return input().split()
def LS(): return list(input())
def LLS(rows_number): return [LS() for _ in range(rows_number)]
def printlist(lst, k=' '): print(k.join(list(map(str, lst))))
INF = float('inf')







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

if __name__ == '__main__':
    solve()

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

Solution (Python):
S = str(input())
s = list(map(str, S))
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()

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

Solution (Python):
from sys import stdin


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


if __name__ == "__main__":
    main()

Solution (Python):
S = input()

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

Solution (Python):
S = input()


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

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

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

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

Solution (Python):

a = input()

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

Solution (Python):
import math
from collections import defaultdict
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:input()

"""========main code==============="""


t=1
for _ in range(t):
    s=ip()
    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[len(S)-1] == 's':
    S += 'es'
else:
    S += 's'

print(S)

Solution (Python):
s = input()

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

Solution (Python):
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):
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    S = input()
    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):
def I(): return input()
s=I()

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

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

print(ans)

Solution (Python):
import sys
import math
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def input(): return sys.stdin.readline().strip()
s=input()
l=len(s)
if s[l-1]=="s":
    ans=s+"es"
else:
    ans=s+"s"
print(ans)

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

for i in S:
    print(i,end="")

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

Solution (Python):
s = input()

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

print(s)

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

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

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

Solution (Python):
S = input()

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

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

Solution (Python):
s = input()

if s.endswith("s"):
    s += "es"
else:
    s += "s"

print(s)

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

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

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

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

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


main()

Solution (Python):
s = input()
n = len(s)

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

Solution (Python):
def readinput():
    s=input()
    return s

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

if __name__=='__main__':
    s=readinput()
    ans=main(s)
    print(ans)