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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()
Ss = '{}s'.format(S) if not S.endswith('s') else '{}es'.format(S)

Submission status: Wrong Answer

Solution code:
S=input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S=input()

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

Submission status: Wrong Answer

Solution code:
for y in range(10**3):
  for z in range(10**3):
    if 1+y*y == 2*z:
      print("x=1,y="+str(y)+",z="+str(z))

Submission status: Wrong Answer

Solution code:
s = input()

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

Submission status: Wrong Answer

Solution code:
s = input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = input()
if x.endswith("s") == True:
  x = x + "es"
else:
  x = x + "s"

Submission status: Wrong Answer

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

# ---------------------------------------

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

Submission status: Wrong Answer

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 inpl():
    return list(map(int, input().split()))
def _debug(obj):
    print(obj, file=sys.stderr)

# ---------------------------------------

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

Submission status: Wrong Answer

Solution code:
string = input('入力して下さい')
if string.endswith('s'):
    print(string + 'es')
else:
    print(string + '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:
def main():
    import sys
    inl = sys.stdin.buffer.readline
    
    n = input()
    print(n)
    if(n[len(n)-1] =="s"):
        n+='es'
    else:
        n+='s'
    print(n)


        


    




















if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print((input()+'s').replace('ss','ses'))

Submission status: Wrong Answer

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

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:
from __future__ import division, print_function
 
import os,sys
from io import BytesIO, IOBase
import math
 
if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip
 
 
def ii():  return int(input())
def si():  return input()
def mi():  return map(int,input().strip().split(" "))
def msi(): return map(str,input().strip().split(" "))
def li():  return list(mi())
 
def dmain():
    sys.setrecursionlimit(1000000)
    threading.stack_size(1024000)
    thread = threading.Thread(target=main)
    thread.start()
    
#from collections import deque, Counter, OrderedDict,defaultdict
#from heapq import nsmallest, nlargest, heapify,heappop ,heappush, heapreplace
#from math import log,sqrt,factorial,cos,tan,sin,radians
#from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right
#from decimal import *
#import threading
#from itertools import permutations
#Copy 2D list  m = [x[:] for x in mark] .. Avoid Using Deepcopy
 
abc='abcdefghijklmnopqrstuvwxyz'
abd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}
mod=1000000007
#mod=998244353
inf = float("inf")
vow=['a','e','i','o','u']
dx,dy=[-1,1,0,0],[0,0,1,-1]
def getKey(item): return item[1] 
def sort2(l):return sorted(l, key=getKey,reverse=True)
def d2(n,m,num):return [[num for x in range(m)] for y in range(n)]
def isPowerOfTwo (x): return (x and (not(x & (x - 1))) )
def decimalToBinary(n): return bin(n).replace("0b","")
def ntl(n):return [int(i) for i in str(n)]
def ncr(n,r): return factorial(n)//(factorial(r)*factorial(max(n-r,1)))
 
def ceil(x,y):
    if x%y==0:
        return x//y
    else:
        return x//y+1
 
def powerMod(x,y,p):
    res = 1
    x %= p
    while y > 0:
        if y&1:
            res = (res*x)%p
        y = y>>1
        x = (x*x)%p
    return res
 
def gcd(x, y):
    while y:
        x, y = y, x % y
    return x
    
def isPrime(n) : # Check Prime Number or not 
    if (n <= 1) : return False
    if (n <= 3) : return True
    if (n % 2 == 0 or n % 3 == 0) : return False
    i = 5
    while(i * i <= n) : 
        if (n % i == 0 or n % (i + 2) == 0) : 
            return False
        i = i + 6
    return True
 
 
 
def read():
    sys.stdin  = open('input.txt', 'r')  
    sys.stdout = open('output.txt', 'w') 
 
 
def main():
    
              
    #for _ in range(ii()):
    s = input()
    if s[-1] == 'es':
        print(s + 's')
    elif s[-1] == 'e':
        print(s + 's')
    else:
        print(s + 'es')
    
    
    
    
    
        
    
# region fastio
# template taken from https://github.com/cheran-senthil/PyRival/blob/master/templates/template.py
 
BUFSIZE = 8192
 
 
class FastIO(IOBase):
    newlines = 0
 
    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None
 
    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()
 
    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()
 
    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)
 
 
class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")
 
 
def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()
 
 
if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
 
input = lambda: sys.stdin.readline().rstrip("\r\n")
 
# endregion
 
 
if __name__ == "__main__":
    #read()
    main()
    #dmain()
 
# Comment Read()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input("")
if len(S)<=1000 and len(S)>=1:
    if S.endswith(('o', 'ch', 's', 'sh', 'x', 'z')):
        print(S.lower()+"es")
    else:
        print(S.lower()+"s")

Submission status: Wrong Answer

Solution code:
S = input("")
if len(S)<=1000:
    if S.endswith(('o', 'ch', 's', 'sh', 'x', 'z')):
        print(S.lower()+"es")
    else:
        print(S.lower()+"s")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
word = input()
ans = []
j = 0
for i in word:
    j += 1

if word[j - 1] != 's':
    ans = word + 's'
elif word[j - 1] == 's' and j > 1:
    ans = word + 'es'
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
word = input()
ans = []
if word.islower() == True and 1 <= len(word) <= 1000:
    j = 0
    for i in word:
        j += 1

    if word[j - 1] != 's':
        ans = word + 's'
    elif word[j - 1] == 's' and j > 1:
        ans = word + 'es'
    print(ans)

Submission status: Wrong Answer

Solution code:
word = input()
ans = []
tmp = []
if word.islower() == True and 1 <= len(word) <= 1000:
    j = 0
    for i in word:
        j += 1

    if word[j - 1] != 's':
        ans = word + 's'
    elif word[j - 1] == 's' and j > 1:
        tmp = word.rstrip('s')
        ans = tmp + 'es'
    print(ans)

Submission status: Wrong Answer

Solution code:
from sys import stdin

input = stdin.readline



def solve():

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



if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
val = input()

if(val[-1] == 's' or val[-1] == 'h' or val[-1] =='x' or val[-1] =='o' ):
  print(val + 'es')
else:
  print(val+'s')

Submission status: Wrong Answer

Solution code:

S = input("Enter String: ") 
if S.endswith('s') :
    output = S + "es"
else :
    output = S + "s"
print(output)

Submission status: Wrong Answer

Solution code:
S = str(input(""))
S.lower()
if (len(S) <=100 and S.endswith(('o', 'ch', 's', 'sh', 'x', 'z'))):
    print(S+"es")
elif(len(S) <= 1000):
    print(S+"s")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

N=input()
l=len(N)
if(N[:l]=='e'):
 print(N+'s')
elif(N[:l]=='s'):
 print(N+'es')
else:
 print(N+'s')

Submission status: Wrong Answer

Solution code:
S = str(input(""))
S.lower()
if S.endswith(('o', 'ch', 's', 'sh', 'x', 'z')):
    print(S+"es")
else:
    print(S+"s")

Submission status: Wrong Answer

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


elif s[-1]!=s:
    print(s+"s")

Submission status: Wrong Answer

Solution code:
S = str(input(""))
S.lower()
if S.endswith('y'):
    print(S[:-1]+"ies")
elif S.endswith(('o', 'ch', 's', 'sh', 'x', 'z')):
    print(S+"es")
else:
    print(S+"s")

Submission status: Wrong Answer

Solution code:
word = []
word = input()
ans = []
if word.islower() == True and len(word) <= 1000 and len(word) >= 1:
    j = 0
    for i in word:
        j += 1

    if word[j - 1] != 's':
        ans = word + 's'
    elif word[j - 1] == 's' and j > 1:
        ans = word + 'es'
    print(ans)

Submission status: Wrong Answer

Solution code:
word = []
word = input()
ans = []
if word.islower() == True and len(word) <= 1000 and len(word) >= 1:
    j = 0
    for i in word:
        j += 1

    if word[j - 1] != 's':
        ans = word + 's'
    elif word[j - 1] == 's' and j > 1:
        ans = word + 'es'

print(ans)

Submission status: Wrong Answer

Solution code:
S = input()

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

Submission status: Wrong Answer

Solution code:
word = []
word = input()
ans = []
if word.islower() == True and len(word) <= 1000 and len(word) >= 1:
    j = 0
    for i in word:
        j += 1

    if word[j - 1] != 's':
        ans = word + 's'
    elif word[j - 1] == 's' and j > 1:
        ans = word[:j-1] + word[j:] + 'es'

print(ans)

Submission status: Wrong Answer

Solution code:
S = str(input(""))
if S.endswith('y'):
    print(S[:-1]+"ies")
elif S.endswith(('o', 'ch', 's', 'sh', 'x', 'z')):
    print(S+"es")
else:
    print(S+"s")

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:
def pural():
	S = input("Enter String: ") 
	if S.endswith('s') :
		output = S + "es"
	else :
		output = S + "s"
	print(output)
# your code goes here

Submission status: Wrong Answer

Solution code:
s=str(input())
print(s+"s")

Submission status: Wrong Answer

Solution code:
s = input("Enter Input:")

if s[len(s) -  1] != "s":
    s += "s"

elif s[len(s) - 1] == "s":
    s += "es"

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

Submission status: Wrong Answer

Solution code:
S = str(input(""))
if S.endswith(('o', 'ch', 's', 'sh', 'x', 'z')):
    print(S+"es")
else:
    print(S+"s")

Submission status: Wrong Answer

Solution code:
s = list(input())

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

print(len(s))


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

if f == "s":
  ans = s+es
  ans = "".join(ans)
  print(ans)
else:
  ans = s+ss
  ans = "".join(ans)
  print(ans)

Submission status: Wrong Answer

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

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

print(s_list)

Submission status: Wrong Answer

Solution code:
S = input()

Str_list = [S[0:len(S)-1] , S[-1]]

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

x = len(Str_list)
if x == 2:
  print(str(Str_list[0]+Str_list[1]))
elif x == 3:
  print(str(Str_list[0]+Str_list[1]+Str_list[2]))

Submission status: Wrong Answer

Solution code:
print(str(input())+'s')

Submission status: Wrong Answer

Solution code:
print(input()+'s')

Submission status: Wrong Answer

Solution code:
S = str(input())

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

Submission status: Wrong Answer

Solution code:
s = input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()

Str_list = [S[0:len(S)-1] , S[-1]]

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

x = len(Str_list)
if x == 2:
  print(Str_list[0]+Str_list[1])
elif x == 3:
  print(Str_list[0]+Str_list[1]+Str_list[2])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N=input()
l=len(N)
if(N[:l]=='e'):
 print(N+'s')
elif(N[:l]=='s'):
 print(N+'es')
else:
 print(N+'s')

Submission status: Wrong Answer

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


if s1[0] == 's':
    s2 = s1.replace('s', 'se', 1)
    s = s2[::-1]
else:
    s = s + 's'
print(s)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

s = input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

Solution code:
S = input()

N = S[-1]

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

else:
    print(S+'es')

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline().strip()
last_alpha = input[-1]
if last_alpha == 's':
    print(input[0:-1] + 'es')
elif last_alpha == 'e':
    print(input + 's')
else:
    print(input + 's')

Submission status: Wrong Answer

Solution code:
s = input()
if len(s) == 1:
    print(s)
    exit()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

s = input()
s = fukusu(s)

print(s)

Submission status: Wrong Answer

Solution code:
s = input()

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import math

from fractions import Fraction as frac

MOD = 1e9 + 7

def gcd(a, b):

    if b == 0:

        return a

    return gcd(b, a % b)

def lcm(a, b):

    return a * b // gcd(a, b)

def solve(case_no):

    s = str(input())

    if s[len(s) - 1] == 's':

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

    	print(s + 's')

t = 1

# t = int(input())

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

    solve(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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:
from sys import stdin

input = stdin.readline

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

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline().strip()
last_alpha = input[-1]
if last_alpha == 's':
    print(input[0:-1] + 'es')
else:
    print(input + 's')

Submission status: Wrong Answer

Solution code:
#                               #
    # author : samars_diary #
    # 19-09-2020 │ 17:33:02 #
#                               #

import sys, os.path

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

sys.setrecursionlimit(10 ** 5)

def mod(): return 10**9+7
def i(): return sys.stdin.readline().strip()
def ii(): return int(sys.stdin.readline())
def li(): return list(sys.stdin.readline().strip())
def mii(): return map(int, sys.stdin.readline().split())
def lii(): return list(map(int, sys.stdin.readline().strip().split()))

#print=sys.stdout.write

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

Submission status: Wrong Answer

Solution code:
word = input()

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

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:
z = input()
if z[-1]in['s','x','z','ch','sh']:
  print(z+'es')
elif z[-1]=='y'and z[-2]not in['a','e','i','o','u']:
  print(z[:-1]+'ies')
elif z[-2:]=='fe':
  print(z[:-2]+'ves')
elif z[-1]=='f':
  print(z[:-1]+'ves')
elif z[-1]=='o'and z[-2]not in['a','e','i','o','u']:
  print(z[:-1]+'oes')
else:
  print(z+'s')

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = str(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(ret)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
word = input()

last = word[-1]

if last == 's':
  word = f'{word}es'
else:
  word = f'{word}s'

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = str(input())

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

Submission status: Wrong Answer

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

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

def main():
    return

main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
""" A
"""
import sys
import math
from functools import reduce
from bisect import bisect_left

def readString():
    return sys.stdin.readline()

def readInteger():
    return int(readString())

def readStringSet(n):
    return sys.stdin.readline().split(" ")[:n]

def readIntegerSet(n):
    return list(map(int, readStringSet(n)))

def readIntegerMatrix(n, m):
    return [lambda _: readIntegerSet(m) for _ in range(0, n)]

def main(S):
    return S + "es" if S.endswith("s") else S + "s"

if __name__ == "__main__":
    _S = readString()

    print(main(_S))