#include <bits/stdc++.h>
using namespace std;
const int mod = (1e9) + 7;
const double eps = 1e-6;
const int siz = 2e3 + 5, siz2 = 1e4 + 5;
int n, po[30];
char source[siz], target[siz];
vector<int> op, ans, pos[30];
void step(int x) {
  ans.push_back(x);
  vector<int> v1(op.begin() + n - x, op.end());
  reverse(v1.begin(), v1.end());
  vector<int> v2(op.begin(), op.begin() + n - x);
  v1.insert(v1.end(), v2.begin(), v2.end());
  op = v1;
}
void adjust(int v, int sorted) {
  int rest = 0, i;
  for (i = 0; i < n; i++) {
    if (op[i] == v) {
      rest = n - i - 1;
      break;
    }
  }
  step(rest);
  step(n - rest - sorted);
  step(sorted);
}
int main() {
  scanf("%d%s%s", &n, source + 1, target + 1);
  for (int i = 1; i <= n; i++) {
    pos[target[i] - 97].push_back(i);
  }
  for (int i = 1; i <= n; i++) {
    if (po[source[i] - 97] == pos[source[i] - 97].size()) {
      printf("-1\n");
      return 0;
    }
    op.push_back(pos[source[i] - 97][po[source[i] - 97]]);
    po[source[i] - 97]++;
  }
  int middle = n / 2 + n % 2;
  bool odd = n % 2;
  adjust(middle, 0);
  int bef = middle - 1, aft = middle + 1;
  for (int i = 0; i < n - 1; i++) {
    int cur = aft;
    if (odd) {
      cur = bef;
    }
    adjust(cur, i + 1);
    if (odd) {
      bef--;
    } else {
      aft++;
    }
    odd = !odd;
  }
  int sz = ans.size();
  printf("%d\n", sz);
  for (int i = 0; i < sz; i++) {
    printf("%d", ans[i]);
    if (i != sz - 1)
      printf(" ");
    else
      printf("\n");
  }
  return 0;
}
