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

Submission status: Accepted

Solution code:
S = input()
m = 's'
n = 'es'
if S[-1] == 's':
	res = "".join((S,n))
	print(res)
else:
	res1 = "".join((S,m))
	print(res1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
l=len(s)
list_s=list(s)
ans=""
if(s[l-1]!="s"):
    list_s.append("s")
elif(s[l-1]=="s"):
    list_s.append("es")

for i in range(0,len(list_s)):
    ans+=list_s[i]

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
a = list(input())
if a[-1] == 's':
  a.append('e')
  a.append('s')
else:
  a.append('s')

print(''.join(a))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
if(len(s)==0):
  print("")
if(s[-1] == "s"):
  print(s+"es")
if(s[-1] != "s"):
  print(s+"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()
n=len(S)
if S[n-1]=='s':
    print(S+'es')
else:
    print(S+'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:
word = input()

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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
word = input()

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

Submission status: Accepted

Solution code:
s=input()
v='s'
if s[-1]=='s':
    v='es'

print(s+v)

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:
import math

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
l = len(S)

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

Submission status: Accepted

Solution code:
s=list(input())
length=len(s)
if(s[length-1]=='s'):
  s.append('es')
else:
  s.append('s')

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
S = str(input())

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

print( S + fix )

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
s_list=list(s)
 
x=len(s_list)

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

print("".join(s_list))

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

if S[-1] == "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()
i=len(S)-1

if S[i]=="s":
    out=S+"es"
else:
    out=S+"s"

print(out)

Submission status: Accepted

Solution code:
#
# 179A
#
s = input()
s1 = list(s)

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

Submission status: Accepted

Solution code:
S = list(input())

if S[len(S)-1] != 's':
  S.append('s')
else:
  S.append('es')

print(''.join(S))

Submission status: Accepted

Solution code:
a = input()
arr = list(a)
if arr[-1] == "s":
  arr.insert(len(arr), "es")
  print("".join(arr))
else:
  arr.insert(len(arr), "s")
  print("".join(arr))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())

es = list("es")
ss = list("s")

#print(len(s))


f = s[len(s)-1]
#print(f)

if f == "s":
  ans = s+es
  ans = "".join(ans)
  print(ans)
else:
  ans = s+ss
  ans = "".join(ans)
  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
from collections import defaultdict
input = stdin.readline
# ~ T = int(input())
T = 1
for t in range(1,T + 1):
	s = input()
	s = s[:len(s) - 1]
	if s[len(s) - 1] == 's':
		s += 'es'
	else:
		s += 's'
	print(s)

Submission status: Accepted

Solution code:
a=input()
if(a[-1]=="s"):
    a.rstrip("s")
    print(a,"es",sep="")
else:
    print(a,"s",sep="")

Submission status: Accepted

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

Submission status: Accepted

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

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


answer(input())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(S)

Submission status: Accepted

Solution code:
inp = input()
print(inp,end='')
if inp[-1] == 's':
    print("e",end='')
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 = input()
a = len(s)
if s[a-1] == 's':   
    print(s+'es')
else:
    print(s+'s')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a=input()
b=list(a)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding: UTF-8

S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())

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

Submission status: Accepted

Solution code:
n = input()
n = [ c for c in n]
if(n[-1]=='s'):
    n.append('es')
elif(n[-1]!='s'):
    n.append('s')
n=''.join(n)
print(n)

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

Submission status: Accepted

Solution code:
s = input()
l = len(s)
x = s[l-1]
if x == "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()
a = len(S)
if S[a-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:
import math
s=input()
if(s[len(s)-1]=='s'):
    print(s+'es')
else:
    print(s+'s')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
l=list(s)
#print(l)
if(l[-1]=='s'):
	l.append('e')
	l.append('s')
else:
	l.append('s')
#print(l)
str1=""

for i in l:
	str1+=i
print(str1)

Submission status: Accepted

Solution code:

st = input()

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

print(st)

Submission status: Accepted

Solution code:
s = []
s =  input()

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

Submission status: Accepted

Solution code:
s=str(input())
s_split=list(s)
s_last=s_split[-1]


if s_last == 's' :
    print(s+'es')
else:
    print(s+'s')

Submission status: Accepted

Solution code:
string = input()

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

Submission status: Accepted

Solution code:
def plural():
	s = input()
	if s[-1] == 's' : ans = s + "es"
	else : ans = s + "s"
	return ans

def main()	:
	print(plural())

if __name__	 == '__main__' :
	main()

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

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:
'''
    Auther: ghoshashis545 Ashis Ghosh
    College: jalpaiguri Govt Enggineering College

'''
from os import path
import sys
from heapq import heappush,heappop
from functools import cmp_to_key as ctk
from collections import deque,defaultdict as dd 
from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right
from itertools import permutations
from datetime import datetime
from math import ceil,sqrt,log,gcd
def ii():return int(input())
def si():return input().rstrip()
def mi():return map(int,input().split())
def li():return list(mi())
abc='abcdefghijklmnopqrstuvwxyz'
mod=1000000007
# mod=998244353
inf = float("inf")
vow=['a','e','i','o','u']
dx,dy=[-1,1,0,0],[0,0,1,-1]

def bo(i):
    return ord(i)-ord('a')



    
def solve():

    
    # for _ in range(ii()):


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

    print(s) 












        
if __name__ =="__main__":

    
    if path.exists('input.txt'):
        sys.stdin=open('input.txt', 'r')
        sys.stdout=open('output.txt','w')
    else:
        input=sys.stdin.readline
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
b = [x for x in a]

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

Submission status: Accepted

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

print(s)

Submission status: Accepted

Solution code:
def i_input(): return input()


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

print(s)

Submission status: Accepted

Solution code:
A = str(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+'es')
else:
    print(a+'s')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
str = input()

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

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

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

Submission status: Accepted

Solution code:
S = input()

n = len(S)

S_a = list(S)

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

Submission status: Accepted

Solution code:
input_n = input()
n = str(input_n)

listN = list(n)
#listN = n.split(' ')

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

for i in range(len(listN)):
    print(listN[i], end = "")

Submission status: Accepted

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

elif s[-1] == 's':
    ans = s + 'es'
else:
    ans = s + 's'

print(ans)

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s=input()
sss=list(s)
sss.reverse()
if sss[0]=="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:
if __name__ == "__main__":
    S = input()

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

Submission status: Accepted

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

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

#print( s[-1] )

if s[ -1 ] != "s":
    s = s + "s"

else:
    s = s + "es"


print( s )

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
S = input()

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

Submission status: Accepted

Solution code:
pal = input()

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

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

print(s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math

def solve():
	solve = str(input());
	if solve[-1]=='s':
		solve+="es";
	else:
		solve+="s";
	print(solve);
	#arr = [int(x) for x in input().split()]
solve();

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 = list(str(input()))
L = len(S)
if S[L-1] == "s":
    S.append("es")
else:
    S.append("s")
K =''.join(S)
print(K)

Submission status: Accepted

Solution code:
#!python3.8
# -*- coding: utf-8 -*-
# abc179/abc179_a
import sys

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

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

main()

Submission status: Accepted

Solution code:
s = input()

a = s[len(s) - 1]

#print(a)

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

print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
st = input()

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

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

Submission status: Accepted

Solution code:
input_date = input()
input_length = len(input_date)
input_end = input_date[input_length - 1]

if (input_end == "s"):
  print(input_date + "es")
else:
  print(input_date + "s")

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

s = input()

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

Submission status: Accepted

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

print(a)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(str)

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

Solution code:
i = input()

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

Submission status: Accepted

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

print(ret)

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

Submission status: Accepted

Solution code:
d = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input_str = input()

if input_str.endswith("s"):
    print(f"{input_str}es")
else:
    print(f"{input_str}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 = str(input())

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

 print( S + "es" )

else:

 print( S + "s" )

Submission status: Accepted

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

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

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

######################################################

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

Submission status: Accepted

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