#include <bits/stdc++.h>
using namespace std;
long long int n, ct[27];
string s, t;
void trans(long long int sz) {
  string tem;
  while (sz--) {
    tem += s.back();
    s.pop_back();
  }
  tem += s;
  s = tem;
}
map<string, long long int> ss;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> s >> t;
  for (char c : s) ct[c - 'a']++;
  for (char c : t) ct[c - 'a']--;
  for (long long int i = 0; i <= 25; ++i)
    if (ct[i]) {
      cout << -1 << '\n';
      return 0;
    }
  vector<long long int> ans;
  if (n == 1) {
    cout << 0 << '\n';
    return 0;
  }
  if (n % 2) {
    char ch = t[n / 2];
    long long int ps = n - 1;
    while (s[ps] != ch) ps--;
    ans.push_back(n - ps);
    ans.push_back(n);
    ans.push_back(n - ps);
    ans.push_back(ps);
    reverse(s.begin() + ps, s.end());
  }
  bool rev = false;
  long long int sz = 0;
  if (n % 2) sz = 1;
  for (long long int i = n / 2 - 1; i >= 0; i--) {
    long long int j = n - 1 - i;
    char cx = t[i], cy = t[j];
    if (!rev) swap(cx, cy);
    long long int ypos = 0;
    while (s[ypos] != cy) ypos++;
    ans.push_back(n - 1 - ypos);
    trans(n - 1 - ypos);
    ans.push_back(n);
    trans(n);
    ans.push_back(sz);
    trans(sz);
    long long int xpos = n - 1;
    while (s[xpos] != cx) xpos--;
    ans.push_back(n - xpos);
    trans(n - xpos);
    ans.push_back(xpos - sz - 1);
    trans(xpos - sz - 1);
    sz += 2;
    rev = !rev;
  }
  if (rev) {
    ans.push_back(n);
    trans(n);
  }
  cout << ans.size() << '\n';
  for (long long int v : ans) cout << v << " ";
  cout << '\n';
}
