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:
import time
startTimeProblem=time.time()

import fileinput, sys, itertools, functools
from math import *
from bisect import *
from heapq import *
from collections import *

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

class InputHelper:
    def __init__(self):
        self.myinput = fileinput.input()

    def isLocal(self):
        return not fileinput.isstdin()

    def int(self):
        return int(self.myinput.readline().rstrip())

    def ints(self):
        return [int(_) for _ in self.myinput.readline().rstrip().split()]

    def str(self):
        return self.myinput.readline().rstrip()

    def strs(self):
        return [_ for _ in self.myinput.readline().rstrip().split()]

class OutputHelper:
    def int(self, a):
        print(a)    

    def ints(self, a):  
        print(" ".join([str(_) for _ in a]))
    
    def intsNL(self, a):
        for _ in a:
            print(_)
    
    def str(self, s):
        print(s)

    def strs(self, s):
        print(" ".join([_ for _ in s]))

    def strsNL(self, s):
        for st in s:
            print(st)

class ListNode:
    def __init__(self, val):
        self.val = val
        self.next = None
        self.prev = None

In = InputHelper()
Out = OutputHelper()

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

S = In.str()

if S[-1]=="s":
    Out.str(S+"es")
else:
    Out.str(S+"s")

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

if len(sys.argv)>2 and sys.argv[2]=="TIMEIT":
    fin = (time.time()-startTimeProblem)*1000
    print("{:.2f}".format(fin) + "ms")

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

def main():
    mod=10**9+7
    S=input()
    if S[-1]=="s":
        S+="es"
    else:
        S+="s"
        
    print(S)

main()

Submission status: Accepted

Solution code:
class Main:
    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 += "e"
print(s + "s")

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
N = input()

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s = input()

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

print(ans)

Submission status: Accepted

Solution code:
import math
t = 1
for tc in range(t):
    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()
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()
print(s + ('s' if s[-1] != 's' else 'es'))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def S(): return input().rstrip()
def LS(): return S().split()
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float("INF")

#solve
def solve():
    s = S()
    print(s + ["es", "s"][s[-1] != "s"])
    return


#main
if __name__ == '__main__':
    solve()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin


def ans():
    _in = [_.rstrip() for _ in stdin.readlines()]
    S = _in[0]  # type:str
    # vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
    if S[-1] == 's':
        S += 'es'
    else:
        S += 's'
    ans = S
    # ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
    print(ans)


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


if __name__ == "__main__":
    #main()
    ans()

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

Submission status: Accepted

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

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

print(''.join(str(i) for i in s))

Submission status: Accepted

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

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+'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:
# This code is generated by [Atcoder_base64](https://github.com/kyomukyomupurin/AtCoder_base64)
import base64
import subprocess
import zlib


exe_bin = "c%1E9eQ+Da6<>Wgb`nQc5{D>BLqu?j1NdUaA8{Zql5II>;siIAgZW4nSvp(S$dZvx!46CtCXhiBLOo0eLZLGrm@;KL(}wA^!+$jxLdy)(&`u#!K9ZJ?N>IQp6w&}z-`?#?cdI+ThT$)7CVuyR_ukvLZ};}R@1B1Y?CrMOY=|`n`W_-&W3|TnDL&Ou6alOaErg#JqP1uN@J^i^PtVzmw5r&Trq^cIc%FU-8L3T2E0A@2q{c`Q@)q@oul}{vzqMWiJx%-dR~Yr|RBw>#4N`eV-BgcJHa;i)AEG!<yO5DODeZexiIVHnOEjLRy~s$J-uFRo0s8XIP3dmhpH*C@slSY}dDs+}hgzFA#iI>zIguG}7;kHBXl)kKNnx|<lbgzJ-!-7hllivme6FP!x&QhVfwzA8z=sPq6;8bLn)lVYTd%%hlE^MYrFkO}wt?m{YNPgeb!Ym%N@lXGJwf&P<^qlNCir=qx%_~I9h==8f80VoZ(;v^3wdlI-)@2b&BD$)#8$GgowBgA)?!?43p-a@;15{%GXVWAMXQkCt7*CEf|^7ce$z!7?qLfJ)>&GKMlQRItgTjr@yKX0fzwJjrC^M3PiQBON-1eXPAgI>w6imwOh}>dP+ZdPncum-Uul*S(Rfd!U-9`Ov2Y42sj#f1dm_Q$Zory`!f82zlW8R-g-3frIMj%P{jFG4ZHmYVxY*UNw8_ad22rWGCm}0czTg4Cqw&52+-+Y=dLj|Qx5!EiT#w4h;1C(f_&6SuQt4zO9G8^|e4tS^?`y@ZV=O1qQcC&CZuafyZ^CgiA3HT4Vf>L~Mp3U)X*2u%VXhO|*vS^W8;ozkI5Ix&^Z7PwLLeh2Mtb_2aeoUA`EW2uCU7JIcgXzt5FSX}A}6AFx0KF|O5|pQO)Si5WIv9?_T%BO97kX(E<v23gD?&&(zvWpW>_WxI|%cLi9THnqhXkp?VX*tNoYjddwV)M@n)g9c(qw*L7jtxfsP*R6Ph%5a1ex>h0Q(#yH(GTC1{78%Ax+W!wysd`;i@0BC^*zkapi*+}mvM?<rg9dFlJ^#9|`3skndI(HVNb5&qZ8@)EKmZn0}vX0^PK?2Lh;yi?r+*?#?(U+;%ER3+L;<!?TBzn$!mgOtzyXrrCHAx9{$Y`nLMc$i`DH@dI0_f#W&uZSFu==;Bq!)Ga8<u&4rKebMy3s7mlC+)Njuh!vbb+}81=X7|D4xiQGZXJG3hcDIPZt53_;bI-m_8;=P*Y8to{~`Et9e#+~uSBJHAZd5$aEA_`)ZtDYeq4v^e~+2c;rjRZFLZdN4nLv8t91AiI((rHpVr}vbod{1_!1p19{yLAc(me~6<#FXIjz_Wr^LfgSIwY8%M}0>Hf)2RHS7FvMfey|$)7Di+pwANBt-dBDt{^A$x_HqtNePxlThVPsQhZelMv;nRDK!ZNoewuD!+*EBqaGmDsLw|aW_Av^5<)TCn3n+r1JkEJQ;evPvzeRet43NYoOm(fU&iS+1I1uQRjwwGS+NYUA=EQ*9hX`u}-&mtUY)Ej63_9_-w_xm0EzrXS?duK#N&t-N~*xH_DOz#iOA*2vl<&D9u7ohi<!|kXEkCb*Z-6Q+A^8Ozy7`5b;<`L}i~6v+w6FCIUcTo+C!K)rp5^+~U?VN<}UYh;Ldv+FMs26`QJ67c-k6{B1Yvoyom3ryBN9!?$UM7nTe^2LkW>Jog*D-Rv`(>3in1PG1B%T(ho==(eZGSYf(zCsdX8zb^;=*owDR(h^edK3$dXAUc!2cYCrg>=U#95D&jG+ZXCRR&h}EV2MK|?GJ%eVZ{;9{gByz9GC&|SjA(+;MQ|u_Dy9KEUoL8YfEd%-on{op=RA3YMA%VkX2RULH}mWksqjLHqL>*_~e{J%+88W=B^TLC&d@$6b~4@h#IUW2CeKJYQG)Uj~dVRKP`i+0pd?J4EsEAx#vGC6mlXA;bg^iAZH`$hlt(>Gg`ce_}=_*fyFPs7&J=eCj-|8_Vi?53Je4wHXB~6QHS2}7SR4c_OqVsN4*>0RG+OUKXc^n{}cj#=evs6_cAlkn?2u~{irMZexOkM3e25N-1=(fZ88Bj><!!)*c;dvz%!Gj4nLTo&#L-#YVQ{*4Rnp;%3iuR3_>@@$u+n-4b%g)8m6lr=4u<zL7?Obj=`u-104rC2zU<Y6y5A<>GNYdxEtBV-L^H=l~t3rN;kpD87&7kFVpQG=JE*DQTZo6DHKi+0hhbm<+-|M@hw${&{eCiytJuqJ<}&=BR}}A-`~ide<S?A3w&n#XYq`9u&-C`t@6RGOTB0f>+^D?_3H#%i-31N2u#4`K4K5JJck|Ku0H#37r8uu1YA{t#mED<Nu1sQd4U+-;d1YDX<iVYULi4r{v`r*xZFRscep(FID#(kF=vOX{_YCV)p%rq=xRG$xzpuOx!MA*#(=B7!{r4zknaFnWE^$iiy!Rh-;;%ct!51jY{!GPcWvlS`{$i?=i7XnZ}V-w&A0hB-{#wVn{V@NzI}U*<xg2sljTSC-z)X>DVvc$V>75D4^7T7vrp5DRg`D>+clJDIndRVvV1K&6SK4Pf9DEGLXXqKCOcP7(c~n{IkNA3EJt`d<yr33L+J`+Y%KQ~qxnR3rk$mf<pWp_b0wwq3yt_}rP1#;8XuO+Wc^==jB=k8wDH*}G)MV9YOg?f=I1Qs*VFs|qr5&>`%O0Xy_j#^G|+n}9j5dErAH{ekJ3je{T-zzDSc6&)cqQb<?mVB-r0GDw|-zKlTb3=EkcXX*wB<wIo}U`Z9-%7Mh*QkwjD4lZ6;r8$@i3yDegduDef$;Un5>oT(?GiL2-Q>@yg=78}X{*dNJY)i|f*eFDkBIBfhx!92@a!)M$z?L1#^I7n(K2Yl{1V5qG0grufog{eTf)hU#5r_;NH^V}{oj_a7s^qPXuE@e54Xy#t<pwoe#wc)Go2c<Fnw5no+~k?q2X{$1d4@-4?szA({^R-pJLs?I7jvEEzMC#}`OPJr6EsoIElQhbWT_fUM6!{fByajxH6)$8(jK1}U2a`X5rRla;)to(mom0yPLHkn^D`Ipt7<?H7?)lT{ReyskiE%U$1rs2GwYiz_$`FilF-$*^k!_E612l=jAzE0ZIx`NXBXOI1Mi#mq`HuE}=doARN>@wZ+xQI^JqZab-5r6ESvVHXvz%K%veV1hKFPoFtDSxh4TGV6sEb!|cnxCwGi{<2l7V;0N^5y$g*sl4{$A8qq&T|%cyTiQRBjnKLm!C(6I`6B{q4h>Q?9lKse;nrh-b>@qN8>3`{9z0E8Haft%NYy#kE#7>YM;G+DxKzaENh+ScD6am+HxU3wZncd+v_y<CvJfsv9ON<xG$bbh2yw8nHm)$V`B(!@4coY(2H?8GlYAzx(QMT(%XiyoRkx?f+8s;tz?FWg$ODY*I;E7M@SJ(8etqw;*ofA2<%3cWGaornQ;_Jj*i78MT!brTDP{D3z6at8HZD;@C23;N@@ZPr^2HWj%G$jCqPBVVd9EG6yxsQft^7d+|@;DfAIEQ12`yBQ0&@`aMyLa0y}#;;hsS`Y6R4RkzyRK>F(|ihHxm*(HjJ-QZ%fD5$?H0t<*{2Oj?S5aXF9QuP+)g)~V2Yv<OA3YcXP9zaWY4H=0i3SQsoxsOwrGB@GMabw;|X8r~IBzr>q0*5;Hn$i2|cPBtUoWc8B41!3#AP^x6?akH;fCsh_@SR!l{;h}VzU7Oci@!D$9QY4*Gm!xSOnBT7}Rr=f-H$yoUbVTc)be)g~u2{Ba>Po48ieC!5%7fhsi+4nc1^aeHOpEa>3hqpc<&54SAw4mwgol7CDUHV1m7D;RV@OCO6-j`=G$`Q_%8ev4!cazzM;qiQQn^?-9YaENA_4X^s-(0#2O!FFGGSma+)GLEFcG9zV{wIa36n!Eg^?s&z@q{`)nE##q`F54QjG3bv1qEqf%QlPOXCq~Ou>peexbDaXg1h2^cfzNBXFS_gr$T8*hWWTzcbs+zj`Bi0`dxC?<cD|Yu0QWe=*X|=1iZjWA<|L{Bg_2>9cbkqjg`PPrkQ*1ZQ)m&(430)>E9lH}$mwr0qgl?t<y_^~`7KfJy$trqgG62J-v6zIK_NCmFq+J9qN&+lRE=0~2HCPDXkE?Ht{Yv|I+`+4+>wDOB>`fy&2!5NR<j=3^?2l;v0W__6WdLG?Q*&(6DyviuIwUumL$57O6gm-1VTvOExL{QPG*eRh6k^aLmG=IBp2eRj@fl#f>xM}NlYv)}(2{WCZJZX=5x;q=+>_l)xC1AhFEA>;GQ&NqzmX$fBcaZcar?+L8*f6wW&d;y~|Zo%{M{3EB&@(PSD=j8e4hnzo2S1fN=`uhZp=i|-K-#?L7Kg#skxwLPsxxc*r2dMOHkyiTq586K+*aA+E`E{I*iO-M5)|KvmUjLtR`o;4SCG0ul^;xsiglI8-RNq7O{oMNXbNZDwt$#kz$MiRHxLMxY?2j}=s(+j=VDcUkQ2G9`Q0Ke8oxMb(zvLDyzkZfl=pVgYqi#-t*Z)66!oec"

open("./kyomu", 'wb').write(zlib.decompress(base64.b85decode(exe_bin)))
subprocess.run(["chmod +x ./kyomu"], shell=True)
subprocess.run(["./kyomu"], shell=True)

Submission status: Accepted

Solution code:
s=input()
n=len(s)
if s[n-1]!='s':
  s=s[0:n]+'s'
elif s[n-1]=='s':
  s=s[0:n]+'es'
print(s)

Submission status: Accepted

Solution code:
name = input()
length = len(name)

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

print(name)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())
if S[len(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'))

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

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

Submission status: Accepted

Solution code:
a=input()
print(a+"e"*(a[-1]=='s')+'s')

Submission status: Accepted

Solution code:
a = input()
print(a + "e"*(a[-1]=='s') + 's')

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1 << 25)
readline = sys.stdin.buffer.readline
read = sys.stdin.readline  # 文字列読み込む時はこっち
ra = range
enu = enumerate


def exit(*argv, **kwarg):
    print(*argv, **kwarg)
    sys.exit()


def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))
# 受け渡されたすべての要素からsubだけ引く.リストを*をつけて展開しておくこと


def a_int(): return int(readline())


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


def read_col(H):
    '''H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) #一列の場合'''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, readline().split())))
    return tuple(map(list, zip(*ret)))


def read_tuple(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, readline().split())))
    return ret


def read_matrix(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, readline().split())))
    return ret
    # return [list(map(int, read().split())) for _ in range(H)] # 内包表記はpypyでは遅いため


MOD = 10**9 + 7
INF = 2**31  # 2147483648 > 10**9
# default import
from collections import defaultdict, Counter, deque
from operator import itemgetter, xor, add
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  # , insort_left, insort_right
from functools import reduce
from math import gcd


def lcm(a, b):
    # 最小公倍数
    g = gcd(a, b)
    return a // g * b


S = input()
add = 'es' if S.endswith('s') else 's'
print(S + add)

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left, insort, insort_left
from heapq import heappush, heappop
from functools import reduce, lru_cache
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def TUPLE(): return tuple(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = 10**6#float('inf')
mod = 10 ** 9 + 7 
#mod = 998244353
#from decimal import *
#import numpy as np
#decimal.getcontext().prec = 10

S = input()

if S[-1] == "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:
#!/usr/bin/env python3
import sys
import collections as cl


def II(): return int(sys.stdin.readline())


def MI(): return map(int, sys.stdin.readline().split())


def LI(): return list(map(int, sys.stdin.readline().split()))


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

    print(target+"s")


main()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline

def main():
    s = input().rstrip('\n')
    if s[-1] == 's':
        s += 'es'
    else:
        s += 's'

    print(s)

if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


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


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    s = input()
    if s[-1] != 's':
        print(s+'s')
    else:
        print(s+'es')

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=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:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
# import decimal
# from decimal import Decimal
# decimal.getcontext().prec = 10

# from heapq import heappush, heappop, heapify
# import math
# from math import gcd
# import itertools as it
# import collections
# from collections import deque 

def inp():
    return int(input())
def inps():
    return input().rstrip()
def inpl():
    return list(map(int, input().split()))
def _debug(obj):
    print(obj, file=sys.stderr)

# ---------------------------------------
s = inps()
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:
import sys

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

Submission status: Accepted

Solution code:
word = input()

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

print(word)

Submission status: Accepted

Solution code:



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

    #print(d[0])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys  import stdin,stdout
 
st=lambda:list(stdin.readline().strip())
li=lambda:list(map(int,stdin.readline().split()))
mp=lambda:map(int,stdin.readline().split())
inp=lambda:int(stdin.readline())
pr=lambda n: stdout.write(str(n)+"\n")
 
mod=1000000007
INF=float('inf')


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

else:
    s += 's'

print(s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(S)

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

Solution code:
def main():
    import sys
    inl = sys.stdin.buffer.readline
    
    n = input()

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


        


    




















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:
import math
import collections
import fractions
import itertools
import functools
import operator
import bisect

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

if __name__ == "__main__":
    solve()

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def Next(): return input()
def NextInt(): return int(Next())
def NextInts(): return map(int,input().split())
def Nexts(): return map(str,input().split())
def NextIntList(): return list(map(int,input().split()))
def RowInts(n): return [input() for i in range(n)]

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

Submission status: Accepted

Solution code:
s = input()
p = ""

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

print(p)

Submission status: Accepted

Solution code:
S = input()

if S.rfind("s") == len(S) - 1:
	print(S + "es")
else:
	print(S + "s")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
word = input()
if word[-1] == 's':
    word += "e"
print(word + "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":
  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:
'''
自宅用PCでの解答
'''
import math
#import numpy as np
import itertools
import queue
import bisect
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit
#from scipy.sparse.csgraph import dijkstra
#from scipy.sparse import csr_matrix
ipt = stdin.readline
setrecursionlimit(10**7)
mod = 10**9+7
# mod = 998244353
dir = [(-1,0),(0,-1),(1,0),(0,1)]
alp = "abcdefghijklmnopqrstuvwxyz"
INF = 1<<32-1
# INF = 10**18

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

    return None

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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


if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

def get_input() -> str:
    """
    標準入力を取得する.

    Returns:\n
        str: 標準入力
    """
    S = input()

    return S


def main(S: str) -> None:
    """
    メイン処理.

    Args:\n
        S (str): 文字列(1 <= |S| <= 1000, 英子文字のみ)
    """
    # 求解処理
    ans = S
    if S[-1] == "s":
        ans += "es"
    else:
        ans += "s"

    # 結果出力
    print(ans)


if __name__ == "__main__":
    # 標準入力を取得
    S = get_input()

    # メイン処理
    main(S)

Submission status: Accepted

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