Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
C. Lock Puzzle

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputWelcome to another task about breaking the code lock! Explorers Whitfield and Martin came across an unusual safe, inside of which, according to rumors, there are untold riches, among which one can find the solution of the problem of discrete logarithm!

Of course, there is a code lock is installed on the safe. The lock has a screen that displays a string of *n* lowercase Latin letters. Initially, the screen displays string *s*. Whitfield and Martin found out that the safe will open when string *t* will be displayed on the screen.

The string on the screen can be changed using the operation «shift *x*». In order to apply this operation, explorers choose an integer *x* from 0 to *n* inclusive. After that, the current string *p* = αβ changes to β^{R}α, where the length of β is *x*, and the length of α is *n* - *x*. In other words, the suffix of the length *x* of string *p* is reversed and moved to the beginning of the string. For example, after the operation «shift 4» the string «abcacb» will be changed with string «bcacab », since α = ab, β = cacb, β^{R} = bcac.

Explorers are afraid that if they apply too many operations «shift», the lock will be locked forever. They ask you to find a way to get the string *t* on the screen, using no more than 6100 operations.

Input

The first line contains an integer *n*, the length of the strings *s* and *t* (1 ≤ *n* ≤ 2 000).

After that, there are two strings *s* and *t*, consisting of *n* lowercase Latin letters each.

Output

If it is impossible to get string *t* from string *s* using no more than 6100 operations «shift», print a single number - 1.

Otherwise, in the first line output the number of operations *k* (0 ≤ *k* ≤ 6100). In the next line output *k* numbers *x*_{i} corresponding to the operations «shift *x*_{i}» (0 ≤ *x*_{i} ≤ *n*) in the order in which they should be applied.

Examples

Input

6

abacbb

babcba

Output

4

6 3 2 3

Input

3

aba

bba

Output

-1

In the first example, after applying the operations, the string on the screen will change as follows:

- abacbb bbcaba
- bbcaba ababbc
- ababbc cbabab
- cbabab babcba

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/18/2021 01:04:43 (i2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|