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
from math import ceil as C, floor as F, sqrt, gcd as G
from collections import defaultdict as D, Counter as CNT
from functools import reduce as R
import heapq as HQ

class Heap:
  def __init__(self, data, reverse=False):
    self.reverse = -1 if reverse else 1
    self.data = [self.reverse * d for d in data]
    HQ.heapify(self.data)
  def push(self, x): return HQ.heappush(self.data, self.reverse * x)
  def pop(self): return self.reverse * HQ.heappop(self.data) 

ALP = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
alp = 'abcdefghijklmnopqrstuvwxyz'
def _X(): return sys.stdin.readline().rstrip().split(' ')
def _S(ss): return tuple(ss) if len(ss) > 1 else ss[0]
def S(): return _S(_X())
def Ss(): return list(S())
def _I(ss): return tuple([int(s) for s in ss]) if isinstance(ss, tuple) else int(ss)
def I(): return _I(S())
def _Is(ss): return list(ss) if isinstance(ss, tuple) else [ss]
def Is(): return _Is(I())

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

Submission status: Accepted

Solution code:
S = input()
print(S + ('es' if S[-1] == 's' else '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:
#Python Competetive Programming Template

from sys import stdin, stdout
from math import *

testing = True

def tp(s="\n"):
	if testing:
		stdout.write(s)

def main():
	s = stdin.readline().strip()
	if s[-1] != "s":
		s += "s"
	else:
		s += "es"
	stdout.write("{0}\n".format(s))
	

main()

Submission status: Accepted

Solution code:
import itertools

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

Submission status: Accepted

Solution code:
S = input()

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

print(S)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ss = str(input())
myend = len(ss) -1

if ss[myend] == 's':
    print(ss+'es')
else:
    print(ss+'s')

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
# 幅優先探索（行きがけ）
import collections
import sys
import copy
import re
import math


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


def main():
    s = S()

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**6)

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

print(A)

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

Submission status: Accepted

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

print(ans)

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:
#!/usr/bin/env python

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

print(ans)

Submission status: Accepted

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


input = sys.stdin.readline


def ST():
    return input().rstrip()


def I():
    return int(input())


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


def LI():
    return list(MI())


S = ST()

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
s = input()

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

print(s)

Submission status: Accepted

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

print(s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(S)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

import sys
from collections import defaultdict, deque
from heapq import heappush, heappop
import math
import bisect
input = sys.stdin.readline

# 再起回数上限変更
# sys.setrecursionlimit(1000000)

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

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

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


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

Submission status: Accepted

Solution code:
s = input().strip()
if s.endswith("s"):
    s+="es"
else:
    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()

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

Submission status: Accepted

Solution code:
S = input()

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

print(S + s)

Submission status: Accepted

Solution code:
import sys

input_ = sys.stdin.readline
S = input_().strip()

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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

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

if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
def resolve():
    import sys
    input = sys.stdin.readline

    s = input().rstrip()

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


if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
from collections import Counter
import math
import statistics
import itertools
a=input()
# b=input()
# c=[]
# for i in a:
#     c.append(int(i))
# A,B,C= map(int,input().split())
# f = list(map(int,input().split()))
# g = [input() for _ in range(a)]
# h = []
# for i in range(a):
#     h.append(list(map(int,input().split())))
# a = [[0] for _ in range(H)]#nizigen

if a[-1]=="s":
    print(a+"es")
else:
    print(a+"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:
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:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

s = input().strip()

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

Submission status: Accepted

Solution code:

import sys
import bisect as bi
import math
from collections import defaultdict as dd
import heapq
import itertools
##import operator
input=sys.stdin.readline
import random
##sys.setrecursionlimit(10**6)
##fo=open("output1.txt","w")
##fi=open("input1.txt","w")
mod=10**9+7
def cin():
    return map(int,sin().split())
def ain():            
    return list(map(int,sin().split()))
def sin():
    return input()
def inin():
    return int(input())

    
for _ in range(1):
    s=sin().strip()
    if(s[-1]=='s'):
        print(s+"es")
    else:
        print(s+'s')
    

    
    
        
        
      
    

##def msb(n):n|=n>>1;n|=n>>2;n|=n>>4;n|=n>>8;n|=n>>16;n|=n>>32;n|=n>>64;return n-(n>>1) #2 ki power
##def pref(a,n,f):             
##    pre=[0]*n
##    if(f==0):         ##from beginning
##        pre[0]=a[0]
##        for i in range(1,n):
##            pre[i]=a[i]+pre[i-1]
##    else:              ##from end
##        pre[-1]=a[-1]
##        for i in range(n-2,-1,-1):
##            pre[i]=pre[i+1]+a[i]
##    return pre
##maxint=10**24 
##def kadane(a,size): 
##    max_so_far = -maxint - 1
##    max_ending_here = 0
##       
##    for i in range(0, size): 
##        max_ending_here = max_ending_here + a[i] 
##        if (max_so_far < max_ending_here): 
##            max_so_far = max_ending_here 
##  
##        if max_ending_here < 0: 
##            max_ending_here = 0   
##    return max_so_far

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

Submission status: Accepted

Solution code:
a = {'a','e','i','o','u'}
n = input()
if n[-1] == 's':
    print(n + 'es')
else:
    print(n+'s')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 標準入力を取得
S = input()

# 求解処理
ans = S
if S[-1] == "s":
    ans += "es"
else:
    ans += "s"

# 結果出力
print(ans)

Submission status: Accepted

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

def input(): return sys.stdin.readline()[:-1]
mod = 10**9 + 7
def readInt():return int(input())
def readIntList():return list(map(int,input().split()))
def readStringList():return list(input())
def readStringListWithSpace():return list(input().split())
def readString():return input()

from itertools import accumulate
 
def execute():
    s = readStringList()
    if s[-1] == 's':
        s += ['e','s']
    else:
        s.append('s')
    print("".join(s))
    
 
if __name__ == "__main__":
    execute()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
# def LF(): return [float(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

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

# main()
print(main())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
T=list(str(input()))

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

Submission status: Accepted

Solution code:
v = input()
if v.endswith('s'):
    print(f'{v}es')
else:
    print(f'{v}s')

Submission status: Accepted

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

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

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:
n=input()
if n[-1]=='s':
    print('{}{}'.format(n,'es'))
else:
    print('{}{}'.format(n,'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()

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import collections
import bisect
from collections import deque
from copy import copy, deepcopy
import time

import numpy as np
import numba
from numba import njit, b1, i4, i8, f8
from numba import jit


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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
S=sys.stdin.readline().strip()
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':
    S=S+'es'
else:
    S=S+'s'
print(S)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
S = input()
if ( S[-1]=='s' ):
  print(S+'es')
else:
  print(S+'s')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

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

Submission status: Accepted

Solution code:
word = input()

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

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

Submission status: Accepted

Solution code:
################################################
#                                              #
#   author: raghav_0901 (Raghav Dalmia)        #
#   updated on: 19-09-2020,  5:32:05 pm IST   #
#                                              #
################################################

from math import *


def _in():
    return [int(x) for x in input().split(' ')]


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

Submission status: Accepted

Solution code:
a=input()

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

Submission status: Accepted

Solution code:
#one, two, three, four, five = map(int, input().split())
#li = list(map(int, input().split()))
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 S.endswith('s'):
    print(S + 'es')
else:
    print(S + 's')

Submission status: Accepted

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

print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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


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

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


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

Submission status: Accepted

Solution code:

if __name__ == '__main__':
    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':
    output = S + 'es'
else :
    output = S + 's'
    
print(output)

Submission status: Accepted

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

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

Submission status: Accepted

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

if tmp=="s":
    print(S+"es")
else:
    print(S+"s")

Submission status: Accepted

Solution code:
# coding: utf-8


def solve(*args: str) -> str:
    s = args[0]

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


if __name__ == "__main__":
    print(solve(*(open(0).read().splitlines())))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 9)
# input = sys.stdin.readline    ####
def int1(x): return int(x) - 1
def II(): return int(input())
def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def MS(): return input().split()
def LS(): return list(input())
def LLS(rows_number): return [LS() for _ in range(rows_number)]
def printlist(lst, k=' '): print(k.join(list(map(str, lst))))
INF = float('inf')
# from math import ceil, floor, log2
# from collections import deque, defaultdict
# from itertools import combinations as comb, combinations_with_replacement as comb_w, accumulate, product, permutations
# from heapq import heapify, heappop, heappush
# import numpy as np    # cumsum
# from bisect import bisect_left, bisect_right

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

if __name__ == '__main__':
    solve()

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
s = input()
if s[-1] == "s":
    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:
from sys import stdin


def main():
    _in = [_.rstrip() for _ in stdin.readlines()]
    S = list(_in[0])  # type:str
    # vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
    ans = 0
    if S[-1] == 's':
        S[-1] += 'es'
    else:
        S[-1] += 's'
    ans = ''.join(S)
    # ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
    print(ans)


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=str(input())

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

Submission status: Accepted

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

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:
import math
from collections import defaultdict
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:input()

"""========main code==============="""

#t=ii()
t=1
for _ in range(t):
    s=ip()
    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':
    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:
a = input()
if a[-1] == "s":
  print(a+"es")
else:
  print(a+"s")

Submission status: Accepted

Solution code:
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    S = input()
    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:
def I(): return input()
s=I()

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

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

print(ans)

Submission status: Accepted

Solution code:
import sys
import math
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def input(): return sys.stdin.readline().strip()
s=input()
l=len(s)
if s[l-1]=="s":
    ans=s+"es"
else:
    ans=s+"s"
print(ans)

Submission status: Accepted

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

for i in S:
    print(i,end="")

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

Submission status: Accepted

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