[codeforces936C]Lock Puzzle

time limit per test : 2 seconds
memory limit per test : 256 megabytes

Welcome 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=\alpha \beta$ changes to ${\beta }^R\alpha$, where the length of $\beta$ is $x$, and the length of $\alpha$ 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 $\alpha =ab$, $\beta =cacb$, ${\beta }^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\le n\le 2000)$.

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\le k\le 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

题意：
给定两个相同长度的字符串$S$和$T$，有一个操作$shift(x)$表示将$S$分成两个部分$\alpha \beta$其中$\beta$的长度为$x$，然后将$S$变成${\beta }^R\alpha$$（{\beta }^R$表示将字符串$\beta$翻转$）$ ， 问能否让$S$在$6100$次操作以内变成$b$,输出操作方案。

题解：
设现在S串可以表示成$X...y...$ , $X$是$T$的一个后缀，$y$是一个字母，$yX$也是$T$的一个后缀，那么设$a$为$y$的下标，那么经过$shift(n-a+1),shift(n),shift(n-a)$三次操作之后，S串将会变成$....X^{R}y$
若S串可以表示成$.....y....X^R$，$X$是$T$的一个后缀，y是一个字母，$yX$也是$T$的一个后缀，设$a$为$y$的下标，那么经过$shift(n-a),shift(1)$两次操作之后，S串将会变成$yX.....$，那么就这样搞了。

#include<bits/stdc++.h>
#define LiangJiaJun main
#define ll long long
using namespace std;
char bs[2004],s[2004],t[2004];
int ans[10004],k,n;
void shift(int x){
     ans[++k]=x;
     for(int i=1;i<=x;i++)bs[i]=s[n-i+1];
     for(int i=x+1;i<=n;i++)bs[i]=s[i-x];
     for(int i=1;i<=n;i++)s[i]=bs[i];
}
bool same(int a,int b,int c,int d){
     if(b-a+1!=d-c+1)return 0;
     for(int i=1;i<=b-a+1;i++){
         if(s[a+i-1]!=t[c+i-1])return 0;
     }
     return 1;
}
int LiangJiaJun(){
    scanf("%d",&n);
    scanf("%s",s+1);
    scanf("%s",t+1);
    int bg=0;
    for(int l=n;l>=1;l--){
        if(same(1,l,n-l+1,n)){
            bg=l;
            break;
        }
    }
    for(int pd=0,i=bg+1;i<=n;i++,pd^=1){
        bool flag=0;
        if(!pd){
            for(int j=i;j<=n;j++){
                if(s[j]==t[n-i+1]){
                    shift(n-j+1);
                    shift(n);
                    shift(n-j);
                    flag=1;
                    break;
                }
            }
        }
        else{
            for(int j=1;j<=n-i+1;j++){
                if(s[j]==t[n-i+1]){
                    shift(n-j);
                    shift(1);
                    flag=1;
                    break;
                }
            }
        }
        if(!flag)return puts("-1"),0;
    }
    if(!same(1,n,1,n))ans[++k]=n;
    printf("%d\n",k);
    for(int i=1;i<=k;i++)printf("%d ",ans[i]);
    puts("");
    return 0;
}