For a string $S$ of length $N$ and an integer $i\ (0\leq i\leq N)$, let us define the string $f_i(S)$ as the concatenation of:

-   the first $i$ characters of $S$,
-   the reversal of $S$, and
-   the last $(N-i)$ characters of $S$,

in this order. For instance, if $S=$ `abc` and $i=2$, we have $f_i(S)=$ `abcbac`.

You are given a string $T$ of length $2N$. Find a pair of a string $S$ of length $N$ and an integer $i\ (0\leq i\leq N)$ such that $f_i(S)=T$. If no such pair of $S$ and $i$ exists, report that fact.

The input is given from Standard Input in the following format:

```
$N$ 
$T$
```

If no pair of $S$ and $i$ satisfies the condition, print `-1`. Otherwise, print $S$ and $i$, separated by a newline. If multiple pairs of $S$ and $i$ satisfy the condition, you may print any of them.

-   $1\leq N \leq 10^6$
-   $N$ is an integer.
-   $T$ is a string of length $2N$ consisting of lowercase English letters.

abc
2

As mentioned in the problem statement, if S= abc and i=2, we have $f_i(S)=$ abcbac, which equals T, so you should print abc and 2.

abab
1

S= abab and i=3 also satisfy the condition.

cga
0

S= agc and i=3 also satisfy the condition.

-1

If no pair of S and i satisfies the condition, print -1.