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.

Examples

Input

apple


Output

apples


Input

bus


Output

buses


Input

box


Output

boxs
FAST_IO = 0
if FAST_IO:
    import io, sys, atexit
    rr = iter(sys.stdin.read().splitlines()).next
    sys.stdout = _OUTPUT_BUFFER = io.BytesIO()

    @atexit.register
    def write():
        sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())
else:
    rr = raw_input
rri = lambda: int(rr())
rrm = lambda: map(int, rr().split())
rrmm = lambda n: [rrm() for _ in xrange(n)]

####
MOD = 10**9 + 7
YES, NO, IMP = "YES", "NO", "IMPOSSIBLE"
from collections import defaultdict as ddic


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

print solve(rr())
