Problem:


Score : 100 points

Problem Statement

In the Kingdom of AtCoder, people use a language called Taknese, which uses lowercase English letters.

In Taknese, the plural form of a noun is spelled based on the following rules:

If a noun's singular form does not end with s, append s to the end of the singular form.

If a noun's singular form ends with s, append es to the end of the singular form.

You are given the singular form S of a Taknese noun. Output its plural form.

Constraints

S is a string of length 1 between 1000, inclusive.

S contains only lowercase English letters.

Input

Input is given from Standard Input in the following format:

S

Output

Print the plural form of the given Taknese word.

Sample Input 1

apple

Sample Output 1

apples

apple ends with e, so its plural form is apples.

Sample Input 2

bus

Sample Output 2

buses

bus ends with s, so its plural form is buses.

Sample Input 3

box

Sample Output 3

boxs



Sample input:
apple


Sample output:
apples

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
#mod = 998244353
INF = 10**18
eps = 10**-7
s=str(input())
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 + "s")
else:
    print(a + "es")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

def resolve():
  S = input()

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

if __name__ == "__main__":
  resolve()

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

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

Submission status: Accepted

Solution code:
import math
import collections
import itertools

def YesNo(Bool):
    if(Bool):
        print("Yes")
    else:
        print("No")
    return

def resolve():

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

resolve()

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 8)

input = sys.stdin.readline


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



if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from collections import deque, Counter, defaultdict
from itertools import chain, combinations
import json
# import numpy as np
import bisect
import sys
import math
import bisect
from functools import lru_cache
import itertools

sys.setrecursionlimit(10 ** 8)

M = 10 ** 9 + 7
INF = 10 ** 17


def main():
    S = input()
    if S[-1] == 's':
        print(S + 'es')
    else:
        print(S + 's')
    # N = int(input())
    # print(2*N)

    # N, K = [int(a) for a in input().split()]
    # A = [int(a) for a in input().split()]
    # T1, T2, T3 = [int(a) for a in input().split()]


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

Submission status: Accepted

Solution code:
import sys

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def main():
    s = input()
    if s[-1] == 's':
        s += 'es'
    else:
        s += 's'
    print(s)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math


def main():
    # n = int(input())
    # n, k = map(int, input().split())
    # h = list(map(int, input().split()))
    s = input()
    # h = [int(input()) for _ in rane(n)]

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




if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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 = s+'es'
else:
    s = s+'s'

print(s)

Submission status: Accepted

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

print("".join(s))

Submission status: Accepted

Solution code:
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)

def input():
    return sys.stdin.readline().strip()

# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
    return [ int(s) for s in input().split(" ")]

# 改行またはスペース区切りの入力をすべて読み込んでイテレータを返します。
def get_all_int():
    return map(int, open(0).read().split())

def log(*args):
    print("DEBUG:", *args, file=sys.stderr)

def main():
    s = input()

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

main()

Submission status: Accepted

Solution code:
import math

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

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:
from sys import setrecursionlimit
from collections import Counter
from collections import defaultdict
from collections import deque
from heapq import heapify
from heapq import heappop
from heapq import heappush
from time import time
setrecursionlimit(10**9)
mod=10**9+7
inf=10**18

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

print(ans)

Submission status: Accepted

Solution code:
# 2020/09/19
# AtCoder Beginner Contest 179 - A

# Input
s = input()

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

# Output
print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**7)
import bisect
import heapq
import itertools
import math
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from math import gcd
from operator import add, itemgetter, mul, xor
def cmb(n,r,mod):
  bunshi=1
  bunbo=1
  for i in range(r):
    bunbo = bunbo*(i+1)%mod
    bunshi = bunshi*(n-i)%mod
  return (bunshi*pow(bunbo,mod-2,mod))%mod
mod = 10**9+7
def I(): return int(input())
def LI(): return list(map(int,input().split()))
def MI(): return map(int,input().split())
def LLI(n): return [list(map(int, input().split())) for _ in range(n)]

#bisect.bisect_left(list,key)はlistのなかでkey未満の数字がいくつあるかを返す
#つまりlist[i] < x となる i の個数
#bisect.bisect_right(list, key)はlistのなかでkey以下の数字がいくつあるかを返す
#つまりlist[i] <= x となる i の個数
#これを応用することで
#len(list) - bisect.bisect_left(list,key)はlistのなかでkey以上の数字がいくつあるかを返す
#len(list) - bisect.bisect_right(list,key)はlistのなかでkeyより大きい数字がいくつあるかを返す
#これらを使うときはあらかじめlistをソートしておくこと！

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

Submission status: Accepted

Solution code:
str1 = input()

if str1[len(str1)-1] == 's':
    print(str1 + 'es')
else:
    print(str1 + '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[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:
#!/usr/bin/python3
# -*- coding: utf-8 -*-
n = input()
if n[-1] == "s":
    print(n + "es")
else:
    print(n + "s")

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()

S = input()

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

Submission status: Accepted

Solution code:
"""
int(input())
map(int, input().split())
list(map(int, input().split()))
input()
input().split()
"""

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

print(a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#solve_ABC179.py

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

Submission status: Accepted

Solution code:
it = lambda: list(map(int, input().strip().split()))


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


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

Submission status: Accepted

Solution code:
S = list(input())

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

Submission status: Accepted

Solution code:
import sys,math,collections
from collections import defaultdict

#from itertools import permutations,combinations
    
def file():
    sys.stdin = open('input.py', 'r')
    sys.stdout = open('output.py', 'w') 
def get_array():
    l=list(map(int, input().split()))
    return l
def get_ints():   
    return map(int, input().split())
    #return a,b
def get_3_ints():   
    a,b,c=map(int, input().split())
    return a,b,c    
def sod(n):
    n,c=str(n),0
    for i in n: 
        c+=int(i)
    return c    
def isPrime(n):
    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 getFloor(A, x):

    (left, right) = (0, len(A) - 1)

    floor = -1
    while left <= right:
        mid = (left + right) // 2
        if A[mid] == x:
            return A[mid]
        elif x < A[mid]:
            right = mid - 1
        else:
            floor = A[mid]
            left = mid + 1
            
    return floor
def chk(aa,bb):
	f=0
	for i in aa:
		for j in bb:
			if(j[0]>=i[0] and j[1]<=i[1]):
				f+=1
			elif(j[0]<=i[0] and j[1]>=i[1]):	
				f+=1
			elif(i[0]==j[1] or i[1]==j[0]):
				f+=1
			else:
				continue
	return f			

#file()
def main():

	s=input()
	if(s[-1]=='s'):
		s+='es'
	else:
		s+='s'
	print(s)	
		
	#for tt in range(int(input())):
	#	a,b=get_ints()
		




				





		


	





        
            
        























    

    
    

        











        
        

        























































                

            







            
            
































        








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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import fractions
import collections
import itertools
S=list(input())

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

Submission status: Accepted

Solution code:
import sys
from sys import stdin,stdout
import math
import random
import heapq
from collections import Counter
from functools import lru_cache
#@lru_cache(maxsize=None) #for optimizing the execution time of callable objects/functions(placed above callable functions)
try:
    for _ in range(1):
        s=input()
        if s[-1]!="s":
            print(s+"s")
        else:
            print(s+"es")
        







    
except EOFError as e:
    print(e)

Submission status: Accepted

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

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

Submission status: Accepted

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

S = readline().strip()
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")
    return

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#n, m, q = map(int, input().split())
#List = list(map(int, input().split()))
#req = [list(map(int, input().split())) for _ in range(q)]
#t = t[:-1]
#print(ans[j], end = "") 改行無しで出力
#[0]*n
#sort = sorted(a)[::-1] 降順
#if l[i] == l[j]: continue
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

def main():
    input = sys.stdin.readline
    s = input().rstrip()
    if s[-1] == "s":
        print(s + "es")
    else:
        print(s + "s")

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**6)
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

s = ns()

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

Submission status: Accepted

Solution code:
from math import *

def cin(): # To take limited number of inputs
    return map(int,input().split())

def cins(): # To take space sepreated strings
    return input.split()

def cino(test=False): # To take individual int input (test = False)
    if not test:
        return int(input())
    else: # To take string input (test = True)
        return input()

def cina(): # array input
  return list(map(int,input().split()))

def ssplit(): # multiple string input
    return list(input().split())

def printlist(l): # To print space seperated array
    for i in l:
        print(i,end=" ")

def main():
    s = cino(True)
    if s[len(s)-1]=='s':
        s += 'es'
    else:
        s += 's'
    print(s)
        

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = input()

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

print(ans)

Submission status: Accepted

Solution code:
# Date [ 2020-09-19 21:00:10 ]
# Problem [ a.py ]
# Author Koki_tkg

import sys
# import math
# import bisect
# import numpy as np
# from decimal import Decimal
# from numba import njit, i8, u1, b1 #JIT compiler
# from itertools import combinations, product
# from collections import Counter, deque, defaultdict

# sys.setrecursionlimit(10 ** 6)
MOD = 10 ** 9 + 7
INF = 10 ** 9
PI = 3.14159265358979323846

def read_str():      return sys.stdin.readline().strip()
def read_int():      return int(sys.stdin.readline().strip())
def read_ints():     return map(int, sys.stdin.readline().strip().split())
def read_ints2(x):   return map(lambda num: int(num) - x, sys.stdin.readline().strip().split())
def read_str_list(): return list(sys.stdin.readline().strip().split())
def read_int_list(): return list(map(int, sys.stdin.readline().strip().split()))
def GCD(a: int, b: int) -> int: return b if a%b==0 else GCD(b, a%b)
def LCM(a: int, b: int) -> int: return (a * b) // GCD(a, b)

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

if __name__ == '__main__':
    Main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

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

print(ans)

Submission status: Accepted

Solution code:
import sys

def main():
    S = sys.stdin.readline().rstrip()

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

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

else:
  print(s+"s")

Submission status: Accepted

Solution code:
S = input()
ls = len(S) - 1

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

print(S)

Submission status: Accepted

Solution code:
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))
def getArray(intn):
    return [int(input()) for i in range(intn)]
def input():
    return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
    return random.randint(ran1, ran2)
def rand_List(ran1, ran2, rantime):
    return [random.randint(ran1, ran2) for i in range(rantime)]
def rand_ints_nodup(ran1, ran2, rantime):
  ns = []
  while len(ns) < rantime:
    n = random.randint(ran1, ran2)
    if not n in ns:
      ns.append(n)
  return sorted(ns)

def rand_query(ran1, ran2, rantime):
  r_query = []
  while len(r_query) < rantime:
    n_q = rand_ints_nodup(ran1, ran2, 2)
    if not n_q in r_query:
      r_query.append(n_q)
  return sorted(r_query)

from collections import defaultdict, deque, Counter
from sys import exit
from decimal import *
from heapq import heapify, heappop, heappush
import math
import random
import string
from copy import deepcopy
from itertools import combinations, permutations, product
from operator import mul, itemgetter
from functools import reduce
from bisect import bisect_left, bisect_right

import sys
sys.setrecursionlimit(1000000000)
mod = 10 ** 9 + 7

#############
# Main Code #
#############

S = input()

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

Submission status: Accepted

Solution code:
import sys

def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())

s = S()

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

Submission status: Accepted

Solution code:
from sys import stdin

def main():

    input = stdin.readline

    S = input()[:-1]

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

import sys

DEBUG = False


def read(t):
    return t(sys.stdin.readline().rstrip())


def read_list(t, sep=" "):
    return [t(s) for s in sys.stdin.readline().rstrip().split(sep)]


def dprint(*args, **kwargs):
    if DEBUG:
        print(*args, **kwargs)
    return


def main():
    s = read(str)
    if s.endswith("s"):
        s += "es"
    else:
        s += "s"
    print(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")
resolve()

Submission status: Accepted

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

    )

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#: Author - Soumya Saurav
import sys,io,os,time
from collections import defaultdict
from collections import Counter
from collections import deque
from itertools import combinations
from itertools import permutations
import bisect,math,heapq
alphabet = "abcdefghijklmnopqrstuvwxyz"

#input = sys.stdin.readline

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

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








'''
# Wrap solution for more recursion depth
#submit as python3
import collections,sys,threading
sys.setrecursionlimit(10**9)
threading.stack_size(10**8)



threading.Thread(target=solve).start()
'''

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:
#!/usr/bin/env python3
import sys


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

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:
def main():
    s = input()
    if s[-1]=='s':
        s+='es'
        print(s)
    else:
        s+='s'
        print(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:
def li():
    return [int(x) for x in input().split()]


S = input()

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

print(S)

Submission status: Accepted

Solution code:
from collections import defaultdict
from collections import deque
from collections import Counter
import math
import itertools

def readInt():
	return int(input())
def readInts():
	return list(map(int, input().split()))
def readChar():
	return input()
def readChars():
	return input().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:
# -*- coding: utf-8 -*-
import sys 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
S = readline().decode().rstrip()
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:
b=input()
if b[-1]=='s' :
  print(b+'es')
else :
  print(b+'s')

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

Submission status: Accepted

Solution code:
S = input()
if S[-1] is "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:
#!/usr/bin/python
# -*- coding: UTF-8 -*-

import sys


def std_in():
    return sys.stdin.readline().strip()


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


def main():
    s = std_in()

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys, math
from collections import defaultdict, deque, Counter
from bisect import bisect_left, bisect_right
from itertools import combinations, permutations, product
from heapq import heappush, heappop
from functools import lru_cache
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mat = lambda x, y, v: [[v]*y for _ in range(x)]
ten = lambda x, y, z, v: [mat(y, z, v) for _ in range(x)]
mod = 1000000007
sys.setrecursionlimit(1000000)

s = rs()

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

print(ans)

Submission status: Accepted

Solution code:
import sys
import math


def input():
    return sys.stdin.readline().rstrip()


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






if __name__ == "__main__":
    main()

# \n

Submission status: Accepted

Solution code:
S = input()

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

print(S)