#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2005;
int n;
char s[MAXN], t[MAXN], tmp[MAXN];
int Read() {
  int x = 0, f = 1;
  char c = getchar();
  while (c > '9' || c < '0') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = (x * 10) + (c ^ 48);
    c = getchar();
  }
  return x * f;
}
void Put1(int x) {
  if (x > 9) Put1(x / 10);
  putchar(x % 10 ^ 48);
}
void Put(int x, char c = -1) {
  if (x < 0) putchar('-'), x = -x;
  Put1(x);
  if (c >= 0) putchar(c);
}
template <typename T>
T Max(T x, T y) {
  return x > y ? x : y;
}
template <typename T>
T Min(T x, T y) {
  return x < y ? x : y;
}
template <typename T>
T Abs(T x) {
  return x < 0 ? -x : x;
}
int cnt[256];
int ans[MAXN * 3], anstot;
bool check() {
  for (int i = 1; i <= n; ++i)
    if (s[i] != t[i]) return 0;
  return 1;
}
void Add(int x) {
  if (!x) return;
  ans[++anstot] = x;
  for (int i = n - x + 1; i <= n; ++i) tmp[n - i + 1] = s[i];
  for (int i = 1; i <= n - x; ++i) tmp[i + x] = s[i];
  for (int i = 1; i <= n; ++i) s[i] = tmp[i];
}
int main() {
  n = Read();
  scanf("%s%s", s + 1, t + 1);
  for (int i = 1; i <= n; ++i) cnt[s[i]]++;
  for (int i = 1; i <= n; ++i) {
    cnt[t[i]]--;
    if (cnt[t[i]] < 0) {
      printf("-1");
      return 0;
    }
  }
  for (int i = 1; i <= n; ++i) {
    if (check()) break;
    int ID = 0;
    for (int j = 1; !ID; ++j)
      if (s[j] == t[i]) ID = j;
    Add(n - ID);
    Add(1);
    Add(n);
  }
  Put(anstot, '\n');
  for (int i = 1; i <= anstot; ++i) Put(ans[i], ' ');
  return 0;
}
