#include <bits/stdc++.h>
using namespace std;
const int inf = (1 << 30) - 1;
const int maxn = 100010;
int IN() {
  int c, f, x;
  while (!isdigit(c = getchar()) && c != '-')
    ;
  c == '-' ? (f = 1, x = 0) : (f = 0, x = c - '0');
  while (isdigit(c = getchar())) x = (x << 1) + (x << 3) + c - '0';
  return !f ? x : -x;
}
int n, T;
int v1[110], v2[110];
int la[1110];
int ans[maxn];
char s1[110], s2[110];
int main() {
  while (~scanf("%d", &n)) {
    scanf("%s%s", s1, s2);
    memset(v1, 0, sizeof(v1));
    memset(v2, 0, sizeof(v2));
    for (int i = 0; i < n; i++) v1[s1[i] - 'a']++;
    for (int i = 0; i < n; i++) v2[s2[i] - 'a']++;
    int flag = 1;
    for (int i = 0; i < 26; i++)
      if (v1[i] != v2[i]) flag = 0;
    int tot = 0;
    for (int i = 0; i < n; i++) {
      if (s1[i] == s2[i]) continue;
      for (int j = i + 1; j < n; j++)
        if (s1[j] == s2[i]) {
          for (int k = j - 1; k >= i; k--)
            swap(s1[k], s1[k + 1]), ans[++tot] = k + 1;
          break;
        }
    }
    for (int i = 1; i <= n; i++)
      if (s1[i] != s2[i]) flag = 0;
    if (!flag) {
      puts("-1");
      continue;
    }
    printf("%d\n", tot);
    for (int i = 1; i <= tot; i++) printf("%d ", ans[i]);
  }
  return 0;
}
