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

Submission status: Accepted

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

Submission status: Accepted

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('ses')
        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: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/Library/Frameworks/Python.framework/Versions/3.5/bin/python3

s = input()

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

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

Submission status: Accepted

Solution code:
s = input() 

if s[-1] in 's':
  print("{}es".format(s))
else:
  print("{}s".format(s))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# input here
_INPUT = """\
apple
"""
"""
K = int(input())
H, W, K = map(int, input().split())
a = list(map(int, input().split()))
xy = [list(map(int, input().split())) for i in range(N)]
p = tuple(map(int,input().split()))
"""
def main():
    S = input()

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


            
if __name__ == '__main__':
    import io
    import sys
    import math
    import itertools
    from collections import deque

    # sys.stdin = io.StringIO(_INPUT)
    main()

Submission status: Accepted

Solution code:
# cook your dish here
import sys,math
try:sys.stdin,sys.stdout=open('input.txt','r'),open('out.txt','w')
except:pass
from sys import stdin,stdout;mod=int(1e9 + 7);from statistics import mode
from collections import *;from math import ceil,floor,inf,factorial,gcd,log2,sqrt,log
ii1=lambda:int(stdin.readline().strip())
is1=lambda:stdin.readline().strip()
iia=lambda:list(map(int,stdin.readline().strip().split()))
isa=lambda:stdin.readline().strip().split()
# print('{:.3f}'.format(1),round(1.123456789,4))
# sys.setrecursionlimit(500000)
def lcm(a,b): return (a*b)//gcd(a,b)
def setbits(n):return bin(n).count('1')
def resetbits(n):return bin(n).count('0')
def modinv(n,p):return pow(n,p-2,p)
def ncr(n,r):
    num,den=1,1;r=min(n,n-r)
    for i in range(r):num*=(n-i);den*=(i+1)
    return num//den
def ncr_p(n, r, p):
    num,den=1,1;r=min(r,n-r)
    for i in range(r):num = (num * (n - i)) % p ;den = (den * (i + 1)) % p
    return (num * modinv(den,p)) % p
def isPrime(num) :
    if num<=1:return False
    if num==2 or n==3:return True
    if (num % 2 == 0 or num % 3 == 0) :return False
    m = int(num**0.5)+1
    for i in range(5,m,6):
        if (num % i == 0 or num % (i + 2) == 0) :return False
    return True
def bin_search(s, low, high, val):
    while low <= high:
        mid = low + (high - low) // 2;
        if s[mid] == val:return mid
        elif s[mid] < val:low = mid + 1
        else:high = mid - 1
    return -1
def sumofdigit(num):
    count=0;
    while num : count+=num % 10;num //= 10;
    return count;
def inputmatrix():
    r,c=iia();mat=[0]*r;
    for i in range(r):mat[i]=iia();
    return r,c,mat;
def prefix_sum(n,s):
    for i in range(1,n):s[i]+=s[i-1]
    return s;
def binomial(n, k):
    if 0 <= k <= n:
        ntok = 1;ktok = 1
        for t in range(1, min(k, n - k) + 1):ntok *= n;ktok *= t;n -= 1
        return ntok // ktok
    else:return 0
def divisors(n):
    res = [];
    for i in range(1,ceil(sqrt(n))+1):
        if n%i == 0:
            if i==n//i:res.append(i)
            else:res.append(i);res.append(n//i)
    return res;

# coding start heres
s=is1()
if s[-1]=='s':
    s+='es'
else:
    s+='s'
print(s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
data = input()

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
from sys import stdin
readline = stdin.readline
def i_input(): return int(readline().rstrip())
def i_map(): return map(int, readline().rstrip().split())
def i_list(): return list(i_map())


def main():
    S = readline().rstrip()
    ans =S + "s" if S[-1] != "s" else S + "es"
    print(ans)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
word = input()
words = list(word)
if words[-1] == "s":
  print(word + "es")
else:
  print(word + "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 = input()
a = (len(s))
if (s[a-1])=="s":
    print(s,"es", sep="")
else:
    print(s,"s", sep="")

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
N = input()

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

s = str(input()).replace('\n', '')
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:
word = input()

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

print(word)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

if(n[-1]=='s'):
	n+="es";
	
else:
	n+="s";

print(n)

Submission status: Accepted

Solution code:
n = input()
if n[-1] == "s":
    ans = n + 'es'
else:
    ans = n + '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:
import sys, os.path
from collections import*
from copy import*
import math
mod=10**9+7
if(os.path.exists('input.txt')):
    sys.stdin = open("input.txt","r")
    sys.stdout = open("output.txt","w")

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

Submission status: Accepted

Solution code:
A=str(input())
listA = list(A)
last = listA[-1]
if last=="s":
    A = A + "es"
else:
    A = A+"s"

print(A)

Submission status: Accepted

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

Submission status: Accepted

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

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:
import sys
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 10 ** 9 + 7

s = S()

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

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

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

Submission status: Accepted

Solution code:
a = input()

b = len(a)

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

Submission status: Accepted

Solution code:

def input_int():
    return(int(input()))

def input_int_list():
    return(list(map(int,input().split())))

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

def run():
    s = input()

    if s.endswith("s"):
        print(s + "es")
        return

    print(s + "s")

run()

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

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()
array = list(S)
N = len(array)
if array[N-1] != 's':
  array += ['s']
else:
  array += ['es']
print(''.join(array))

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

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

else:print(S+"s")

Submission status: Accepted

Solution code:
S = input()

last_char = S[-1]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

else:
  print(n + "s")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math
import sys
import os

sys.setrecursionlimit(10**7)

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

if os.getenv("LOCAL"):
    inputFile = basename_without_ext = os.path.splitext(os.path.basename(__file__))[0]+'.txt'
    sys.stdin = open(inputFile, "r")
INF = float("inf")


S = list(_S())
if S[-1]=='s':
    S.append('es')
else:
    S.append('s')
ans = S

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a = input()
b = list(a)
num = len(b)

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

Submission status: Accepted

Solution code:
s = input()

if s[-1] != 's':

  s += 's'

else:

  s += 'es'

print(s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(S)

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

Submission status: Accepted

Solution code:
s = list(input())
len_s = len(s)
if s[len_s - 1] == "s":
    print("".join(s) + "es")
else:
    print("".join(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:
N=input()
if N[-1]=="s":
  N=N+"es"
else:
  N=N+"s"
print(N)

Submission status: Accepted

Solution code:
def probA():
    S = input()

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

    else:
        print(S + 's')


def main():
    probA()


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=str(input())

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

Submission status: Accepted

Solution code:
def solve(ins):
    if not ins:
        return ''
    if ins[-1] == 's':
        return ins+'es'
    else:
        return ins + 's'
        
print(solve(input()))

Submission status: Accepted

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

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

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

Submission status: Accepted

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

from typing import *



# def solve(S: str) -> str:
def solve(S):
    if S[-1:] == 's':
        return S+'es'
    else:
        return S+'s'

def main():
    S = input()
    a = solve(S)
    print(a)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import collections as cc
import bisect as bi
I=lambda:list(map(int,input().split()))
s=input()
if s[-1]!='s':
	print(s[:len(s)]+'s')
else:
	print(s+'es')

Submission status: Accepted

Solution code:
import sys

if __name__ == '__main__':
    s = sys.stdin.readline().rstrip()
    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(s + "es")
  else:
    print(s + "s")
    
if __name__ == "__main__":
  main()

Submission status: Accepted

Solution code:
a = input()

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

else :
    a += "es"

print(a)

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
s=str(input())
t=len(s)
if s[t-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:
import sys
import numpy as np
import math  # gcdもあるよ
from collections import deque
from collections import defaultdict
from copy import deepcopy
from itertools import accumulate #リストを与えると累積和を返す
def input(): return sys.stdin.readline().rstrip()
from functools import lru_cache #メモ化
INF = 10**9 + 7
mod = 10**9 + 7

def main():
    S = list(input())
    #print(S)
    if S[-1] != 's':
        S.append('s')
    else: S.append('es')
    #print(S)
    print(''.join(S))
    return 0

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s = input()


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

print(s)

Submission status: Accepted

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


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


# 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
    print(solve(S))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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


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


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
    print(solve(S))

if __name__ == '__main__':
    main()

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
#coding:utf-8

S = str(input())

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

Submission status: Accepted

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

ans = S
print(ans)

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 = 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:
import sys, re
import math
import numpy as np
from decimal import Decimal
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul	# 
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd	# 最大公約数
from heapq import heappush, heappop

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.maxsize = 10 ** 15
sys.setrecursionlimit(10 ** 9 + 7)
INF = float('inf')
MOD = 10 ** 9 + 7

# -*- coding: utf-8 -*-

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import re
import queue
import collections
import math
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
# input = sys.stdin.readline
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

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

	return

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(250000)

def main():
    s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

def dump(x):
    print(x, file=sys.stderr)


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

Submission status: Accepted

Solution code:
import sys

def resolve(in_):
    S = next(in_).strip()

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



def main():
    answer = resolve(sys.stdin)
    print(answer)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/python3

#標準出力からの読み込み
x = input()

#計算ロジック
if x[-1] == 's':
    print(x+'es')
else:
    print(x+'s')

Submission status: Accepted

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