#include <bits/stdc++.h>
using namespace std;
int n;
char s[2005], t[2005];
int c1[30], c2[30];
vector<int> ans;
void shift(int x) {
  reverse(s, s + (n - x));
  reverse(s, s + n);
  ans.push_back(x);
}
int main() {
  scanf("%d%s%s", &n, s, t);
  for (int i = 0; i < n; i++) {
    c1[s[i] - 'a']++;
    c2[t[i] - 'a']++;
  }
  for (int i = 0; i < 26; i++) {
    if (c1[i] != c2[i]) {
      printf("-1\n");
      return 0;
    }
  }
  int l = 0, r = 0;
  for (int i = 0; i < n; i++) {
    if (s[i] == t[0]) {
      l = r = i;
      break;
    }
  }
  for (int i = 1; i < n; i++) {
    int k = -1;
    for (int j = 0; j < n; j++) {
      if (j >= l && j <= r) continue;
      if (s[j] == t[i]) {
        k = j;
        break;
      }
    }
    assert(k != -1);
    if (k > r) {
      int x = l, y = (k - r - 1), z = (n - k - 1);
      int w = (r - l + 1);
      shift(z);
      shift(w + y + 1);
      shift(w + x + z);
      l = x + z;
      r = l + w;
    } else {
      assert(k < l);
      int x = k, y = (l - k - 1), z = n - r - 1;
      int w = (r - l + 1);
      shift(y + w + z);
      shift(1);
      shift(x + y + w);
      l = x + y;
      r = l + w;
    }
  }
  assert(l == 0 && r == n - 1);
  for (int i = 0; i < n; i++) assert(s[i] == t[i]);
  int len = (int)(ans).size();
  printf("%d\n", len);
  for (int i = 0; i < len; i++) {
    printf("%d%c", ans[i], (i < len - 1) ? ' ' : '\n');
  }
}
