Spelling Bee Palindrome Challenge

In this challenge, you are given a word. Your task is to modify the word by applying the following transformation rules:

1. If a character is one of the vowels a, e, i, o, or u, replace it with its corresponding next letter as defined by the mapping: \(a\to b,\, e\to f,\, i\to j,\, o\to p,\, u\to v\).
2. If a character is a consonant and exists in the reverse mapping, replace it with its corresponding previous character as defined: \(b\to a,\, c\to b,\, d\to c,\, f\to e,\, g\to f,\, h\to g,\, j\to i,\, k\to j,\, l\to k,\, m\to l,\, n\to m,\, p\to o,\, q\to p,\, r\to q,\, s\to r,\, t\to s,\, v\to u,\, w\to v,\, x\to w,\, y\to x,\, z\to y\).

Other characters (including uppercase letters, digits, and special symbols) remain unmodified.

After transforming the word, check if the resulting string is a palindrome (i.e., it reads the same forwards and backwards). If it is, print Win; otherwise, print Lose.

For example, when the input is student14 the output is Lose and when the input is m@d@m, the output is Win.

inputFormat

The input consists of a single line containing a non-empty word. The word may include lowercase letters, uppercase letters, digits, and special characters.

outputFormat

Output a single word: Win if the transformed word is a palindrome; otherwise, output Lose. Make sure to print the result to standard output.

## sample

student14

Lose

</p>