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: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = input()

b = ["s", "o", "x", "sh", "ch"]
if a[-2:] in b:
    print(a + "es")
else:
    print(a + "s")

Submission status: Wrong Answer

Solution code:
S = input()

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

print(S)

Submission status: Wrong Answer

Solution code:
s = input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin

input = stdin.readline


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


if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
i = input()
if i.startswith("s"):
  print(i+"es")
else:
  print(i+"s")

Submission status: Wrong Answer

Solution code:
s=input()

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

Submission status: Wrong Answer

Solution code:
import sys
import collections as cc
import bisect as bi
I=lambda:list(map(int,input().split()))
s=input()
if s[-1]!='s':
	print(s[:len(s)-1]+'es')
else:
	print(s[:len(s)-1]+'s')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

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


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

Submission status: Wrong Answer

Solution code:
s = input()

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

Submission status: Wrong Answer

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


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

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


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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
if len(S) >= 1 and len(S) <= 1000:
	if S[-1] == "s":
  		print (S, "es", sep = '')
	else:
  		print (S, "s", sep = '')

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

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
     
def main():
    s = S()
    if s[-1] == 's':
        s += 'es'
    else:
        s += 's'
    print(s)

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

print("".join(s))

Submission status: Accepted

Solution code:
S = input()

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

else:
    S = S + "s"

print("{}".format(S))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve():
    string = list(input())
    ans = 0
    if string[-1]=="s":
        ans = "".join(string)+"es"
        print(ans)
        return 
    else:
        print("".join(string)+"s")
        return

solve()

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

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

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

S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

print(a)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()
l=len(S)
s=list(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()

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

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

Submission status: Accepted

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

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

print(s)

Submission status: Accepted

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

print(result)

Submission status: Accepted

Solution code:
# coding:UTF-8
import sys
from math import factorial

MOD = 10 ** 9 + 7
INF = 10000000000


def main():
    # ------ 入力 ------#
    # 1行入力
    a = input()     # 文字列

    # ------ 出力 ------#
    if a[-1] == "s":
        print("{}".format(a + "es"))
    else:
        print("{}".format(a + "s"))

if __name__ == '__main__':
    main()

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

Submission status: Accepted

Solution code:
word = input().rstrip()
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")
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()

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

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


if __name__ == "__main__":
    S = input()
    print(func(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()
Ss = '{}s'.format(S) if not S.endswith('s') else '{}es'.format(S)
print(Ss)

Submission status: Accepted

Solution code:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
    return list(map(int,input().split()))
def m(): #複数文字
    return map(int,input().split())
def onem(): #Nとかの取得
    return int(input())
def s(x): #圧縮
    a = []
    if len(x) == 0:
        return []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): #listをスペースごとに分ける
    return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
    return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False

def pow_k(x, n):
    ans = 1
    while n:
        if n % 2:
            ans *= x
        x *= x
        n >>= 1
    return ans

"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""


n = input()[:-1]

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

Submission status: Accepted

Solution code:
import re

S = input()
if re.findall("s+$", S)== ["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:
word = input()

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

Submission status: Accepted

Solution code:
#abc179a
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 = list(input())
if s[-1] == "s":
  s.append("es")
else:
  s.append("s")
S = "".join(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:
S=input()
s=len(S)
if S[s-1] == "s":
  print(S+"es")
else:
  print(S+"s")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
word = input()

word_len = len(word)

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

Submission status: Accepted

Solution code:
s = list(input())

if s[-1] != 's':
    [print(m, end='') for m in s]
    print('s')
else:
    [print(m, end='') for m in s]
    print('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()
if(S[len(S)-1] == 's'):print(S + 'es')
else :print(S + 's')

Submission status: Accepted

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

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 += 'e'
print(S + 's')

Submission status: Accepted

Solution code:
def sep():
    return map(int,input().strip().split(" "))
def lis():
    return list(sep())


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'

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

print(s)

Submission status: Accepted

Solution code:
import sys
import math
from collections import defaultdict, deque, Counter
from copy import deepcopy
from bisect import bisect, bisect_right, bisect_left
from heapq import heapify, heappop, heappush
    
input = sys.stdin.readline
def RD(): return input().rstrip()
def F(): return float(input().rstrip())
def I(): return int(input().rstrip())
def MI(): return map(int, input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def LF(): return list(map(float,input().split()))
def Init(H, W, num): return [[num for i in range(W)] for j in range(H)]
    
    
def main():
    word = input().rstrip()
    len_w = len(word)
    if word[len_w-1]=="s":
        print(word+"es")
    else:
        print(word+"s") 
if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

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

print(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":
  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
#import numpy as np
import math
#from fractions import Fraction
import itertools
from collections import deque
from collections import Counter
import heapq
#from fractions  import gcd
#input=sys.stdin.readline
import bisect
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+str("es"))
else:
    print(s+str('s'))

Submission status: Accepted

Solution code:
str = input() 

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

print(str)

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

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

else:
    S.append("es")

print(*S, sep="")

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

Submission status: Accepted

Solution code:
# coding:utf-8
s = input()

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

Submission status: Accepted

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

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

s_list = list(s)

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

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

Submission status: Accepted

Solution code:
S=input()

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

Submission status: Accepted

Solution code:
s=input()

def p(val):
    print(val)

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    try:
        s = str(input())
        s.lower()
        if s[len(s)-1] != 's':
            s += 's'
            print(s)
        else:
            s += 'es'
            print(s)
    except Exception:
        pass

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#from collections import deque
#from heapq import heapify, heappop, heappush
#from bisect import insort
#from math import gcd
#from decimal import Decimal
#mod = 1000000007
#mod = 998244353
#N = int(input())
#N, K = map(int, input().split())
#A = list(map(int, input().split()))
#flag = True
#for k in range(N):
#ans = 0
#print(ans)
#print('Yes')
#print('No')
S = input()
if S[-1] != 's':
	print(S + 's')
else:
	print(S+'es')

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
#from collections import deque
#from functools import *
#from fractions import Fraction as f
from copy import *
from bisect import *	
#from heapq import *
from math import gcd
from itertools import permutations as prm,product
 
def eprint(*args):
    print(*args, file=sys.stderr)
zz=1
 
#sys.setrecursionlimit(10**6)
if zz:
	input=sys.stdin.readline
else:	
	sys.stdin=open('input.txt', 'r')
	sys.stdout=open('all.txt','w')
di=[[-1,0],[1,0],[0,1],[0,-1]]
def inc(d,c,x=1):
	d[c]=d[c]+x if c in d else x
def bo(i):
	return ord(i)-ord('A')	
def li():
	return [int(xx) for xx in input().split()]
def fli():
	return [float(x) for x in input().split()]	
def comp(a,b):
	if(a>b):
		return 2
	return 2 if a==b else 0		
def gi():	
	return [xx for xx in input().split()]
def fi():
	return int(input())
def pro(a): 
	return reduce(lambda a,b:a*b,a)		
def swap(a,i,j): 
	a[i],a[j]=a[j],a[i]	
def si():
	return list(input().rstrip())	
def mi():
	return 	map(int,input().split())			
def gh():
	sys.stdout.flush()
def isvalid(i,j):
	return 0<=i<n and 0<=j<m and a[i][j]!="."
def bo(i):
	return ord(i)-ord('a')	
def graph(n,m):
	for i in range(m):
		x,y=mi()
		a[x].append(y)
		a[y].append(x)

t=1
	

while t>0:
	t-=1
	s=input().rstrip()
	if s[-1]=='s':
		print(s+"es")
	else:
		print(s+"s")

Submission status: Accepted

Solution code:
#from collections import deque
#from heapq import heapify, heappop, heappush
#from bisect import insort
#from math import gcd
#mod = 10**9 + 7
#N = int(input())
#N, K = map(int, input().split())
#A = list(map(int, input().split()))
#flag = True
#for k in range(N):
#ans = 0
#print(ans)
#print('Yes')
#print('No')
S = input()
if S[-1] != 's':
	print(S + 's')
else:
	print(S+'es')

Submission status: Accepted

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

Submission status: Accepted

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

S = input()

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
 
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[-1]=='s':
  S += 'es'
else:
  S += 's'
print(S)

Submission status: Accepted

Solution code:
import sys
import os
import math
import bisect
import itertools
import collections
import heapq
import queue
import array

# 時々使う
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
# from decimal import Decimal
# from collections import defaultdict, deque

# 再帰の制限設定
sys.setrecursionlimit(10000000)


def ii(): return int(sys.stdin.buffer.readline().rstrip())
def il(): return list(map(int, sys.stdin.buffer.readline().split()))
def fl(): return list(map(float, sys.stdin.buffer.readline().split()))
def iln(n): return [int(sys.stdin.buffer.readline().rstrip())
                    for _ in range(n)]


def iss(): return sys.stdin.buffer.readline().decode().rstrip()
def sl(): return list(map(str, sys.stdin.buffer.readline().decode().split()))
def isn(n): return [sys.stdin.buffer.readline().decode().rstrip()
                    for _ in range(n)]


def lcm(x, y): return (x * y) // math.gcd(x, y)


MOD = 10 ** 9 + 7
INF = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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