#include <bits/stdc++.h>
using namespace std;
vector<int64_t> ans;
void print(int64_t *p, int64_t n) {
  for (int64_t i = 0; i < n; i++) {
    cout << p[i] << ' ';
  }
  cout << endl;
}
void apply(int64_t *p, int64_t n, int64_t x) {
  rotate(p, p + n - x, p + n);
  reverse(p, p + x);
  ans.push_back(x);
}
void abc_shift(int64_t A, int64_t num, int64_t *p, int64_t n) {
  for (int64_t i = 0; i < n; i++) {
    if (p[i] == num) {
      apply(p, n, n - i - 1);
      apply(p, n, i - A + 1);
      apply(p, n, A);
      break;
    }
  }
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int64_t n;
  cin >> n;
  string a, b;
  cin >> a >> b;
  int64_t p[n];
  int64_t used[n];
  fill(used, used + n, 0);
  for (int64_t i = 0; i < n; i++) {
    for (int64_t j = 0; j < n; j++) {
      if (!used[j] && a[i] == b[j]) {
        used[j] = true;
        p[i] = j;
        break;
      }
    }
  }
  if (accumulate(used, used + n, 0) != n) {
    cout << -1 << endl;
    return 0;
  }
  int64_t cur = n / 2;
  for (int64_t i = 0; i < n; i++) {
    abc_shift(i, cur, p, n);
    if (i % 2 == 0) {
      cur -= i + 1;
    } else {
      cur += i + 1;
    }
  }
  if (!is_sorted(p, p + n)) {
    ans.push_back(n);
  }
  cout << ans.size() << endl;
  for (auto it : ans) {
    cout << it << ' ';
  }
  return 0;
}
