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

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

print(resp)

Submission status: Accepted

Solution code:
x = input()

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

Submission status: Accepted

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

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

print(S)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def func(r):
	if(r[-1] != 's'):
		return r + 's'
	if(r[-1] == 's'):
		return r + 'es'


r = input()
r = func(r)
print(r)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())

last = s[len(s)-1]

if last == "s":
  s.append("es")
else:
  s.append("s")

s = "".join(s)
print(s)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.readline

    S = input().rstrip('\n')
    if S[-1] == "s":
        print(S + "es")
    else:
        print(S + "s")


if __name__ == '__main__':
    main()

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:
#!/usr/bin/env python3
# coding:utf-8

def main():
    stdIn = input()
    stdOut = solve(stdIn)
    print(stdOut)

"""
方針


"""

def solve(stdIn):
    if stdIn[-1] == 's' :
        return stdIn + 'es'
    return stdIn + 's'

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
print(s + "es" if s.endswith("s") else 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()
S += 's' if S[-1] != 's' else '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:
input_line=input()
print(input_line+"es") if input_line[-1] == 's' else print(input_line+"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:
# -*- coding: utf-8 -*-
# 整数の入力
a = str(input())
b = 's'
c = 'es'
# スペース区切りの整数の入力
if a[-1] == 's':
    a = a+c
else:
    a = a+b
# 出力
print("{}".format(a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def ProgramA():
    
    str1 = str(input())

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

    print(result)

if __name__ == '__main__':
    ProgramA()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()

s=list(s)

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

x=''.join(s)

print(x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

leng = len(s)

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

Submission status: Accepted

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

def f(s: str) -> str:
    if s[-1] != 's':
        return s + "s"
    return s + "es"


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

Submission status: Accepted

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

print (solution())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import math
#import itertools
#import numpy as np
#from collections import deque
# sys.setrecursionlimit(10 ** 6)
#MOD = 10 ** 9 + 7
#INF = 10 ** 9
#PI = 3.14159265358979323846

INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))

def do():
    s=STR()
    if s[-1]=='s':
        print(s+'es')
    else:
        print(s+'s')
if __name__=='__main__':
    do()

Submission status: Accepted

Solution code:
# # Make IO faster
# import sys
# input = sys.stdin.readline

# # get single (or) multiple str
# X = input()

# # get single int
# N = int(input())
# # get multiple int (e.g., 2)
# X, Y = map(int, input().split())
# # get multiple int (e.g., 2) for N lines
# XY = [list(map(int, input().split())) for _ in range(N)]

# from IPython import embed; embed(); exit();

# 全部入り
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np
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()
if s[-1] == "s":
    s += "es"
else:
    s += "s"
print(s)

Submission status: Accepted

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

Submission status: Accepted

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

main()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def Convert(string): 
    list1=[] 
    list1[:0]=string 
    return list1

s = str(input())
l = Convert(s)

ans = ''

if l[-1] != 's':
    ans = 's'
else:
    ans = 'es'

print(s+ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

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

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

Submission status: Accepted

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

Submission status: Accepted

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

s = input()
s_list = list(s)

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

s_list.append("s")
print(''.join(s_list))

Submission status: Accepted

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

print(a)

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
str1=input()
str5="es"
str6='s'
if(str1[-1]!='s'):
  str2=str1[0:]+str6[0:]
else:
  str2=str1[0:]+str5[0:]
print(str2)

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

Submission status: Accepted

Solution code:
import random


def gcd(a, b):
    if a == 0:
        return b
    return gcd(b % a, a)


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

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

print(ans)

Submission status: Accepted

Solution code:
# ABC179
# A Plural Form
S = input()
if S[-1] == 's':
    print(S + "es")
else:
    print(S + 's')

Submission status: Accepted

Solution code:
S = list(input())

if S[len(S)-1]=="s":
    print("".join(S+["e","s"]))
else:
    print("".join(S+["s"]))

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

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

print(P)

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
def main():
    S = str(input())

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

    else :
        print(S + "s")

if __name__ == '__main__':
    main()

Submission status: Accepted

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

S = list(input())

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

print(ans)

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

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()
n=len(S)

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
import math
inp = lambda : stdin.readline().strip()

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

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

Submission status: Accepted

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

print(main())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))
#======================================================#
def main():
    s = IS()
    print(s[:]+'s' if s[-1] != 's' else s[:]+'es')

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import itertools
import functools
import math
from collections import Counter
from itertools import combinations
import re

S=input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(''.join(T))

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

s = list(s)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#179-A

S = input()

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

else:
    print(S + "s")

Submission status: Accepted

Solution code:
str = input()

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

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

Submission status: Accepted

Solution code:
s=input()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def plural(source: str) -> str:
    if source[-1] == 's':
        return source + 'es'

    return source + 's'


def main():
    source = input()
    print(plural(source))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x  =input()

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

Submission status: Accepted

Solution code:
input_str = input()

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

print(res)

Submission status: Accepted

Solution code:
def main():
    from sys import stdin
    import re

    readline = stdin.readline

    N=str(readline().rstrip())

    if ( re.match(r'.*s$',N )):
        print(N + 'es')
    else:
        print(N + 's')

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

Submission status: Accepted

Solution code:
s = input()

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

#https://atcoder.jp/contests/agc008/submissions/15248942
sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))

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

Submission status: Accepted

Solution code:
# 初期入力
import sys
#input = sys.stdin.readline  #文字列では使わない
S =input().strip()
if S[-1] !="s":
    S =S +"s"
else:
    S =S +"es"
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:
word = input()
if word[len(word)-1] == 's':
	word += 'es'
else:
	word += 's'
print(word)

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
k=input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=list(input())
if a[len(a)-1]=="s":
    for i in range(len(a)):
        print(a[i],end="")
    print("es",end="")
else:
    for i in range(len(a)):
        print(a[i],end="")
    print("s",end="")

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    print(main())

Submission status: Accepted

Solution code:
S = input()
l = len(S)
if S[l-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:
import sys

def solve():
      input = sys.stdin.readline
      S = input().strip("\n")
      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[len(S)-1] != 's':
    print(S+'s')
else:
    print(S+'es')

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
'''
.append(要素) リストに要素を追加
.extend(リスト) リストを連結する
.insert(場所,要素) 指定した場所に要素追加
del 配列名[場所]
-1で末尾で末尾から一つ前
sort()
sorted(reverse=true)
配列の初期化
配列名=[a]*n+[b]*m
Decimal()
'''

from sys import stdin
from itertools import accumulate, dropwhile, takewhile, groupby
import bisect
import copy
import math
from functools import reduce
from operator import mul
from collections import Counter
import itertools
import fractions
import sys

s = stdin.readline().rstrip()
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 = input()

a_ = 's'

if S[-1] == 's':
    a_='es'

print(S+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=list(str(input()))

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

for i in range(len(S)):
    if i!=len(S)-1:
        print(S[i],end="")
    else:
        print(S[i])

Submission status: Accepted

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

Submission status: Accepted

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

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 -*-

import sys
import math


debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        for line in sys.stdin:
            lines.append(line.strip())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    s = lines[0]
    

    return (s, )


def solve(s):

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

    return result
    


def main():
    # 出力
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r, sep='')
    else:
        print("%s" % result, sep='')

if __name__ == '__main__':

    main()

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

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

Submission status: Accepted

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

import sys

def main():
    s = input()

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

#    b,c = [int(i) for i in input().split()]
#    t_l = [[int(i) for i in input().split()] for _ in range(n)]

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s = input()
# print(s)
# print(s[-1])

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

Submission status: Accepted

Solution code:
s = list(input())

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

Submission status: Accepted

Solution code:
str = input()

length = len(str)

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def calc(s):
    if s[len(s) - 1] == 's':
        ans = s + 'es'
    else:
        ans = s + 's'
    return ans


print(calc(input()))

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

Submission status: Accepted

Solution code:
i = input()

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

a = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S=input()

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