I. Ivisify
time limit per test
0.5 seconds
memory limit per test
1024 megabytes
input
standard input
output
standard output

João is about to visit Bahia for the first time. He has already planned everything: walking through Pelourinho, eating a lot of acarajé, going to the beach, and learning a few local expressions before he arrives. However, his friends from Salvador warned him that's not enough. According to them, anyone who wants to survive the first few conversations must first pass a small informal test.

They explained one of the rules to him (and the most important one): in some playful situations, a word ending with the letter 'u' is changed to avoid an unfortunate rhyme. So, before the trip, João has to practice this transformation correctly.

The transformation is as follows:

  • if the word ends with 'u', remove that final 'u' and append 'ivis';
  • otherwise, keep the word unchanged.

For example, 'caju' becomes 'cajivis', while 'acarajé' remains 'acarajé'.

Given a word, help João produce the correct Bahia-style version and pass the test.

Input

The input contains a single word $$$S$$$ consisting only of lowercase English letters.

It is guaranteed that $$$1 \leq |S| \leq 100$$$.

Output

Output the transformed word according to the rule described above.

Examples
Input
caju
Output
cajivis
Input
acaraje
Output
acaraje
Input
urubu
Output
urubivis
Note