#include <bits/stdc++.h>
using namespace std;
inline int Int() {
  int x;
  scanf("%d", &x);
  return x;
}
inline long Long() {
  long x;
  scanf("%ld", &x);
  return x;
}
inline long long LLong() {
  long long x;
  scanf("%lld", &x);
  return x;
}
inline float Float() {
  float x;
  scanf("%f", &x);
  return x;
}
inline double Double() {
  double x;
  scanf("%lf", &x);
  return x;
}
inline pair<int, int> Pair() {
  pair<int, int> p;
  scanf("%d %d", &p.first, &p.second);
  return p;
}
void Char(char *x) { scanf("%s", x); }
void pI(int x) { printf("%d", x); }
void pL(long x) { printf("%ld", x); }
void pLL(long long x) { printf("%lld", x); }
void pUL(unsigned long long x) { printf("%llu", x); }
void pF(float x) { printf("%f", x); }
void pD(double x) { printf("%f", x); }
void pS(char x[]) { printf("%s", x); }
int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy8[] = {1, -1, 1, -1, 0, 0, -1, 1};
const double PI = acos(-1.0);
const double EPS = 1e-6;
const int MOD = (int)1e9 + 7;
const int maxn = (int)2e5 + 5;
const int LOGN = 20;
int c1[30], c2[30];
vector<int> ans;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  int n;
  string s, t;
  cin >> n;
  cin >> s >> t;
  if (s == t) {
    cout << "0\n";
    return 0;
  }
  for (int i = 0; i < (n); i++) c1[s[i] - 'a']++;
  for (int i = 0; i < (n); i++) c2[t[i] - 'a']++;
  for (int i = 0; i < (26); i++) {
    if (c1[i] != c2[i]) {
      cout << "-1\n";
      return 0;
    }
  }
  for (int i = 0; i < (n); i++) {
    if (s[i] == t[i]) continue;
    for (int j = (i + 1); j <= (n - 1); j++) {
      if (s[j] == t[i]) {
        for (int k = (j - 1); k >= (i); k--) {
          ans.push_back(k + 1);
          swap(s[k], s[k + 1]);
        }
        break;
      }
    }
  }
  int cnt = ans.size();
  cout << cnt << endl;
  for (int i = 0; i < (cnt); i++) cout << ans[i] << " ";
  return 0;
}
