Shifting Boxes and a Caesar Cipher

Sam Porter is a post-apocalyptic courier. He does not enjoy the job, so he studies each order carefully to make it easier on himself.

Today Sam received an order of $n$ boxes. Each box has a product code given by a lowercase Latin letter. Sam stacked all the boxes in some order, then wrote the codes from the top box to the bottom box, which gave him a string $s$. He wondered whether $s$ can be transformed into the string $t$, which described the previous order of $n$ boxes.

Sam can apply the following transformation once to the string $s$:

• Apply a Caesar cipher to all codes. Every letter is cyclically shifted back by a fixed step $d$. For example, with $d = 4$, e becomes a and c becomes y.
• Sam takes $k$ ($0 \le k < n$) boxes from the top of the stack, sets them on the floor, and puts the rest of the stack on top of them. This is a cyclic shift of the string $s$ by $k$ positions.

Help Sam find out whether some transformation turns $s$ into $t$.

The first line contains one integer $n$, the number of boxes in the order ($1 \le n \le 200\,000$). The second line contains the string $t$ of $n$ lowercase Latin letters, the description of the previous order. The third line contains the string $s$ of $n$ lowercase Latin letters, the description of the current order.

If no transformation turns $s$ into $t$, print Impossible. Otherwise, print Success, and on the second line print two integers $k$ and $d$ describing a transformation that turns $s$ into $t$ ($0 \le k < n$, $-26 < d < 26$). If there are several suitable answers, print any of them.