#include <bits/stdc++.h>
using namespace std;
vector<int> ans;
string shiftx(const string s, const int x) {
  if (x == 0) {
    return s;
  }
  ans.push_back(x);
  string ns = s;
  for (int i = 0; i < x; ++i) {
    ns[i] = s[s.size() - i - 1];
  }
  for (int i = x, j = 0; i < ns.size(); ++i, ++j) {
    ns[i] = s[j];
  }
  return ns;
}
int cnt1[27], cnt2[27];
int main() {
  int n;
  string s, t;
  cin >> n;
  cin >> s >> t;
  for (char c : s) ++cnt1[c - 'a'];
  for (char c : t) ++cnt2[c - 'a'];
  for (int i = 0; i < 27; ++i) {
    if (cnt1[i] != cnt2[i]) {
      cout << "-1";
      return 0;
    }
  }
  for (int i = n - 1, j = 0; i >= 0; --i, ++j) {
    if (t[i] == s[i]) continue;
    if (s[0] == t[i]) {
      s = shiftx(s, j);
      s = shiftx(s, s.size() - 1);
    } else {
      int dx = -1, dx1 = -1;
      for (int k = 0; k < i; ++k) {
        if (s[k] == t[i]) {
          dx = k;
        }
        if (i != 0 && k + 1 < i && s[k] == t[i - 1] && s[k + 1] == t[i]) {
          dx1 = k;
        }
      }
      if (dx1 != -1) dx = dx1 + 1;
      s = shiftx(s, n - dx - 1);
      if (j != 0) {
        s = shiftx(s, n - j);
        s = shiftx(s, j);
        s = shiftx(s, n - j);
      }
    }
  }
  cout << ans.size() << "\n";
  for (int i : ans) cout << i << " ";
  return 0;
}
