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



Sample input:
apple


Sample output:
apples

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S = str(input())
if (S.endswith('s')) is True :
    print (S + "es")
else:
    print(S + "s")

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

Solution code:
S = input()

N = S[-1]


if N == 's':
    print(S+'es')

else:
    print(S+'s')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print("".join(S))

Submission status: Accepted

Solution code:
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():
    #k = int(input())
    #tests = 1
    #tests = int(input().strip())
    #for test in range(tests):
        solve()
        
# region fastio

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

# endregion

if __name__ == "__main__":
    main()

Submission status: Accepted

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

x = int(len(s))

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

Submission status: Accepted

Solution code:
s = input()


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
list1 = []
list1  = list(input())
#print(list1)

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

print(''.join(list1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()
# b()
# c()
# d()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# input s : 名詞
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
word = list(input())


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

print(word_comp)

Submission status: Accepted

Solution code:
s=input()
l=len(s)
#print(s,l)
if s[l-1]=='s':
  print(s+'es')
else:
  print(s+'s')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
""" 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))

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

t = s[-1]

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

print(v)

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

last = s[-1]

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
plural = ["s","o","ch","sh","ss"] 
if s[-1] in plural:
    print(s+"es")
else:
    print(s+"s")

Submission status: Accepted

Solution code:
S = input()
result = ""

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()
if s[-1] == 's':
    print("%ses" % s)
else:
    print("%ss" % s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

s = input()

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

Submission status: Accepted

Solution code:
S=list(input())

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def fukusu(s:str):
    #複数形に
    if s[-1] == 's':
        s += 'es'
    else:
        s += 's'
    return s

s = input()
s = fukusu(s)

print(s)

Submission status: Accepted

Solution code:

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
name = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())

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

print(S)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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

# t = int(input())

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

    solve(i)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()

t=s[-1:]

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

Submission status: Accepted

Solution code:
S = input()

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

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

else:
    print(d)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#                               #
    # author : samars_diary #
    # 19-09-2020 │ 17:37:43 #
#                               #

import sys, os.path

#if(os.path.exists('input.txt')):
    #sys.stdin = open('input.txt',"r")
    #sys.stdout = open('output.txt',"w")

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

#print=sys.stdout.write

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

for _ in range(1):
    solve()

Submission status: Accepted

Solution code:
import sys
readline=sys.stdin.readline

S = readline().rstrip()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

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

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

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

#

class UnionFindEx:
    def __init__(self, size):
        #正なら根の番号、負ならグループサイズ
        self.roots = [-1] * size
    def getRootID(self, i):
        r = self.roots[i]
        if r < 0:   #負なら根
            return i
        else:
            r = self.getRootID(r)
            self.roots[i] = r
            return r
    def getGroupSize(self, i):
        return -self.roots[self.getRootID(i)]
    def connect(self, i, j):
        r1, r2 = self.getRootID(i), self.getRootID(j)
        if r1 == r2:
            return False
        if self.getGroupSize(r1) < self.getGroupSize(r2):
            r1, r2 = r2, r1
        self.roots[r1] += self.roots[r2]    #サイズ更新
        self.roots[r2] = r1
        return True

Yes = 'Yes'
No = 'No'

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






main()

Submission status: Accepted

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

moji = len(S)

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
test = input()

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

print(test)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(S: str):

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

    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    solve(S)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:


s = input()

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

print(ans)

Submission status: Accepted

Solution code:
S =input()

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

Submission status: Accepted

Solution code:
from sys import stdin
def ip(): return [int(i) for i in stdin.readline().split()]
def sp(): return [str(i) for i in stdin.readline().split()]


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]
S=input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def createPlural(s):
    if s[-1] == "s":
        return s + "es"
    else:
        return s + "s"

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

Submission status: Accepted

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

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

print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S = input()

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

print(S)

Submission status: Accepted

Solution code:
x=input()

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

  x+="es"

else:

  x+="s"

  

print(x)

Submission status: Accepted

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

print(s)

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
#A

S = input()

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

print(S)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
S = input()
if S[-1:] != 's':
  print("{}{}".format(S, 's'))
else:
  print("{}{}".format(S, 'es'))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
Str = str(input())

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

Submission status: Accepted

Solution code:
# l,r,d =map(int, input().split()))
#i = list(map(int, input().split()))
s= input()
#s = [int(input()) for i in range(3)]

    #2次元配列n行d列
# n,d =map(int, input().split())
# x=[]
# for i in range(n):
#     x.append(list(map(int, input().split())))

    # print (xx[0][0])
    # print (xx[0][1])

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


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

Submission status: Accepted

Solution code:
# import inflect
s = input()

# p = inflect.engine()
# print(p.plural(s))


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

Submission status: Accepted

Solution code:
s =input()

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

Submission status: Accepted

Solution code:
S=input()
if S[-1]!="s":
  S=S+"s"
else:
  S.rstrip()
  S=S+"es"
print("".join(map(str,S)))

Submission status: Accepted

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

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