#include<cstdio>

 #include<cstring>

 #include<string>

 #include<cmath>

 #include<iostream>

 #include<algorithm>

 #include<map>

 #include<set>

 #include<queue>

 #include<vector>

 using namespace std;

 typedef long long ll;

 typedef unsigned int uint;

 typedef unsigned long long ull;

 typedef pair<int,int> PII;

 typedef vector<int> VI;

 #define fi first

 #define se second

 #define MP make_pair

 const int N=;

 int c[N];

 char a[N],b[N];

 int n;

 int read()

 {

    int v=,f=;

    char c=getchar();

    while(c<||<c) {if(c=='-') f=-; c=getchar();}

    while(<=c&&c<=) v=(v<<)+v+v+c-,c=getchar();

    return v*f;

 }

 int main()

 {

   //freopen("1.in","r",stdin);

   //freopen("1.out","w",stdout);

   scanf("%d",&n);

   scanf("%s",b+);

   scanf("%s",a+);

   int flag=;

   for(int i=;i<=n;i++)

    if(a[i]!=b[i]) {flag=; break;}

   int ans=;

   int noans=;

   while(flag)

   {

     int k=;

     flag=;

     for(int i=;i<=n;i++)

      if(a[i]!=b[i]){k=i; flag=; break;}

     if(!k) break;

     int f=;

     for(int i=k+;i<=n;i++)

      if(b[i]==a[k]){f=i; break;}

     if((k)&&(!f)) {noans=; break;}

      else

      {

       for(int j=f-;j>=k;j--)

       {

           c[++ans]=j;

         char t=b[j+];

         b[j+]=b[j];

         b[j]=t;

       }

      }

   }

   if(noans) printf("-1");

    else

    {

        printf("%d\n",ans);

     for(int i=;i<=ans;i++) printf("%d ",c[i]);

    }

   return ;

 }