Algorithms and Data Structures

Plural nouns

Let’s make a simple program that would turn a singular noun into a plural one. There are several rules that we would like to follow:
  1. For regular nouns, add s to the end (cat → cats, house → houses, etc)
  1. If the noun ends with s, ss, sh, ch, x, or z, add es to the end (bus → buses, tax → taxes, etc)
  1. If the noun ends with y, and the letter before y is a consonant, change the ending to ies (city → cities, puppy → puppies)
  1. If the noun ends with y, and the letter before y is a vowel, add s (ray → rays, boy → boys, etc)

Input

The input contains a single word w (1 ≤ |w| ≤ 100).

Output

The program should print the plural version of w.

Examples

Input
Output
bus
buses
cat
cats
table
tables
 

Constraints

Time limit: 2 seconds

Memory limit: 512 MB

Output limit: 1 MB

To check your solution you need to sign in