#include <bits/stdc++.h>
#pragma GCC optimize("-O3")
using namespace std;
const long long N = 1e1 + 5;
void pairsort(long long a[], long long b[], long long n) {
  pair<long long, long long> pairt[n];
  for (long long i = 0; i < n; i++) {
    pairt[i].first = a[i];
    pairt[i].second = b[i];
  }
  sort(pairt, pairt + n);
  for (long long i = 0; i < n; i++) {
    a[i] = pairt[i].first;
    b[i] = pairt[i].second;
  }
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long isPrime(long long n) {
  if (n < 2) return 0;
  if (n < 4) return 1;
  if (n % 2 == 0 or n % 3 == 0) return 0;
  for (long long i = 5; i * i <= n; i += 6)
    if (n % i == 0 or n % (i + 2) == 0) return 0;
  return 1;
}
long long C(long long n, long long r) {
  if (r > n - r) r = n - r;
  long long ans = 1;
  for (long long i = 1; i <= r; i++) {
    ans *= n - r + i;
    ans /= i;
  }
  return ans;
}
long long mod = 1e9 + 7;
long long modexpo(long long x, long long p) {
  long long res = 1;
  x = x % mod;
  while (p) {
    if (p % 2) res = res * x;
    p >>= 1;
    x = x * x % mod;
    res %= mod;
  }
  return res;
}
long long n, cnt2 = 4, cnt3 = 4, cnt4 = 4;
string s1[N], s2[N], s3[N], s4[N], t[N];
void rotate2() {
  for (long long i = 0; i < n; i++) t[i] = s2[i];
  for (long long i = 0; i < n; i++) reverse(t[i].begin(), t[i].end());
  for (long long i = 0; i < n; i++)
    for (long long j = 0; j <= i; j++) swap(t[i][j], t[j][i]);
  for (long long i = 0; i < n; i++) s2[i] = t[i];
}
long long comp2() {
  for (long long i = 0; i < n; i++)
    if (s1[i] != s2[i]) return 0;
  return 1;
}
void rotate3() {
  for (long long i = 0; i < n; i++) t[i] = s3[i];
  for (long long i = 0; i < n; i++) reverse(t[i].begin(), t[i].end());
  for (long long i = 0; i < n; i++)
    for (long long j = 0; j <= i; j++) swap(t[i][j], t[j][i]);
  for (long long i = 0; i < n; i++) s3[i] = t[i];
}
long long comp3() {
  for (long long i = 0; i < n; i++)
    if (s1[i] != s3[i]) return 0;
  return 1;
}
void rotate4() {
  for (long long i = 0; i < n; i++) t[i] = s4[i];
  for (long long i = 0; i < n; i++) reverse(t[i].begin(), t[i].end());
  for (long long i = 0; i < n; i++)
    for (long long j = 0; j <= i; j++) swap(t[i][j], t[j][i]);
  for (long long i = 0; i < n; i++) s4[i] = t[i];
}
long long comp4() {
  for (long long i = 0; i < n; i++)
    if (s1[i] != s4[i]) return 0;
  return 1;
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n;
  for (long long i = 0; i < n; i++) cin >> s1[i];
  for (long long i = 0; i < n; i++) cin >> s2[i];
  for (long long i = 0; i < n; i++)
    s3[i] = s2[i], reverse(s3[i].begin(), s3[i].end());
  for (long long i = 0; i < n; i++) {
    string t;
    for (long long j = 0; j < n; j++) t += s2[j][i];
    reverse(t.begin(), t.end());
    for (long long j = 0; j < n; j++) s4[j] += t[j];
  }
  while (cnt2--) {
    if (comp2()) {
      cout << "Yes";
      return 0;
    }
    rotate2();
  }
  while (cnt3--) {
    if (comp3()) {
      cout << "Yes";
      return 0;
    }
    rotate3();
  }
  while (cnt4--) {
    if (comp4()) {
      cout << "Yes";
      return 0;
    }
    rotate4();
  }
  cout << "No";
  return 0;
}
