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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
s = input()

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

print(s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# cook your dish h
s=input()
if s[-1]!="s":
    s+="s"
elif s[-1]=="s":
    s+="es"
print(s)

Submission status: Accepted

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

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

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


main()

Submission status: Accepted

Solution code:
s = input()
n = len(s)

if s[n-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:
def readinput():
    s=input()
    return s

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

if __name__=='__main__':
    s=readinput()
    ans=main(s)
    print(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()
n_len = len(N)
if N[n_len-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()

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

Submission status: Accepted

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

Submission status: Accepted

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

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

print(s)

Submission status: Accepted

Solution code:
if __name__ == '__main__':

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

Submission status: Accepted

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

class ABC(object):

    def __init__(self):
        pass


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


if __name__ == "__main__":
    obj = ABC()
    obj.main()
    sys.exit(0)

Submission status: Accepted

Solution code:
a =input()
d = a[-1:]

if d =="s":
    print(a+"es")

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

print(s)

Submission status: Accepted

Solution code:
s = str(input())

if s[len(s) - 1] != 's':
    print(s,'s',sep = "")
else :
    print(s,'es',sep = "")

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# AtCoder Beginner Contest 179
# A - Plural Form

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:

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

Submission status: Accepted

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

import numpy as np
S=input()

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

print(S)

Submission status: Accepted

Solution code:
# coding:utf-8

import sys
import math
import time
#import numpy as np
import collections
from collections import deque
from collections import Counter
import queue
import copy
import bisect
import heapq
import itertools


#sys.setrecursionlimit(10**7)
#N, Q = map(int, input().split())
#G = [list(input()) for i in range(H)]
#INF = V * 10001
#A = [int(i) for i in input().split()]
#AB = [list(map(int, input().split())) for _ in range(K)]

S = str(input())
ans = 0
if(S[len(S)-1]=="s"):
    print(S+"es")
else:
    print(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:
N=input()
if N[-1]!="s":
    print(f"{N}s")
else:
    print(f"{N}es")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
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":
        s = s + "es"
    else:
        s = s + "s"

    print(s)

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

print(Ss)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input();print(s+"ess"[s[-1]!="s"::2])

Submission status: Accepted

Solution code:
import sys
import math



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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()


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

Submission status: Accepted

Solution code:
S = input()
if S[-1]=="s":
    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:
#
# abc179 a
#
import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """apple"""
        output = """apples"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """bus"""
        output = """buses"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """box"""
        output = """boxs"""
        self.assertIO(input, output)


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


if __name__ == "__main__":
    # unittest.main()
    resolve()

Submission status: Accepted

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

print(S)

Submission status: Accepted

Solution code:
def readInts():
  return [int(i) for i in input().split()]


S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
import sys
readline = sys.stdin.readline
read = sys.stdin.read

#n,q = map(int, readline().split())
#*a, = map(int, readline().split())

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

Submission status: Accepted

Solution code:
text = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline

S = input()
S = S.replace('\n','')
s_list = list(S)

if s_list[-1] == "s":
    new_S = S + "es"
else:
    new_S = S + "s"
    
print(new_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:
from sys import stdin
def I():
    return stdin.readline().rstrip()
def MI():
    return map(int,stdin.readline().rstrip().split())
def LI():
    return list(map(int,stdin.readline().rstrip().split()))
#main part
s=I()
if s[-1]=='s':
    print(s+'es')
else:print(s+'s')

Submission status: Accepted

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


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


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    solve(S)

if __name__ == '__main__':
    main()

Submission status: Accepted

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


if __name__ == '__main__':
    resolve()

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
word = input()

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

Submission status: Accepted

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

print("".join(n))

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
import sys
import itertools

x = str(input())

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
#N = map(int,input().split())
#AB=[]
#N = int(input())
C = input()
#D, T, S=map(int,input().split())
if C[-1] == "s":
    print(C+"es")
else:
    print(C+"s")

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
s = input()
if s[len(s)-1] == 's':
    print(s+"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:
def main():

    S = input()

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

main()

Submission status: Accepted

Solution code:
S = input()

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

print(S)