#include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 5;
int n, m, cnt[30], cntA[30], cntB[30], nxt[N];
char a[N], s[N], t[N], tmp[N], b[N];
vector<int> res, res_rev;
void push(int i) {
  res.push_back(n - i + 1);
  for (int j = i; j <= n; ++j) tmp[n - j + 1] = a[j];
  for (int j = n - i + 2; j <= n; ++j) tmp[j] = a[j + 1 - n + i - 2];
  for (int j = 1; j <= n; ++j) a[j] = tmp[j];
}
void push_rev(int i) {
  res_rev.push_back(n - i + 1);
  for (int j = i; j <= n; ++j) tmp[n - j + 1] = a[j];
  for (int j = n - i + 2; j <= n; ++j) tmp[j] = a[j + 1 - n + i - 2];
  for (int j = 1; j <= n; ++j) a[j] = tmp[j];
}
void in() {
  for (int i = 1; i <= n; ++i) cout << a[i];
  cout << '\n';
}
void debug() {
  int x;
  while (cin >> x) {
    push(n - x + 1);
    in();
  }
}
int main() {
  cin >> n;
  for (int i = 1; i <= n; ++i) cin >> s[i], cntA[s[i] - 'a']++;
  for (int i = 1; i <= n; ++i) cin >> t[i], cntB[t[i] - 'a']++;
  for (int i = 0; i < 26; ++i)
    if (cntA[i] != cntB[i]) return cout << -1, 0;
  for (int i = 1; i <= n; ++i) {
    a[i] = s[i];
    if (a[i] != a[i - 1]) cnt[a[i] - 'a']++;
  }
  while (1) {
    int pos = 0;
    for (int i = 2; i <= n; ++i)
      if (a[i] == a[1] && a[i] != a[i - 1]) {
        pos = i;
        cnt[a[i] - 'a']--;
        break;
      }
    if (pos) push(pos);
    bool flag = true;
    for (int i = 0; i < 26; ++i)
      if (cnt[i] > 1) flag = false;
    if (flag) break;
    if (!pos) {
      for (int i = n; i >= 1; --i)
        if (a[i] != a[i - 1]) {
          push(i);
          break;
        }
    }
  }
  for (int i = 1; i <= n; ++i) b[i] = a[i];
  memset(cnt, 0, sizeof cnt);
  for (int i = 1; i <= n; ++i) {
    a[i] = t[n - i + 1];
    if (a[i] != a[i - 1]) cnt[a[i] - 'a']++;
  }
  while (1) {
    int pos = 0;
    for (int i = 2; i <= n; ++i)
      if (a[i] == a[1] && a[i] != a[i - 1]) {
        pos = i;
        cnt[a[i] - 'a']--;
        break;
      }
    if (pos) push_rev(pos);
    bool flag = true;
    for (int i = 0; i < 26; ++i)
      if (cnt[i] > 1) flag = false;
    if (flag) break;
    if (!pos) {
      for (int i = n; i >= 1; --i)
        if (a[i] != a[i - 1]) {
          push_rev(i);
          break;
        }
    }
  }
  int cnt = 0;
  for (int i = 1; i <= n; ++i) swap(a[i], b[i]);
  reverse(b + 1, b + n + 1);
  for (int i = 1; i <= n; ++i)
    if (b[i] != b[i - 1]) {
      nxt[b[i]] = b[i - 1];
    }
  int val = b[n];
  while (val) {
    push(1);
    for (int i = n; i >= 1; --i)
      if (a[i] == val) {
        if (i + 1 <= n) push(i + 1);
        break;
      }
    for (int i = n; i >= 1; --i)
      if (a[i] != a[i - 1]) {
        push(i);
        break;
      }
    val = nxt[val];
  }
  cout << res.size() + res_rev.size() << '\n';
  for (int x : res) cout << x << ' ';
  reverse(res_rev.begin(), res_rev.end());
  for (int x : res_rev) cout << x << ' ';
}
