#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Pii = pair<int,int>;
using Vi = vector<int>;
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define rep(i,b,e) for (int i = (b); i < (e); i++)
#define each(a,x) for (auto& a : (x))
#define all(x) (x).begin(),(x).end()
#define sz(x) int((x).size())
#define endl '\n'

void solve() {
    int n;
    cin >> n;
    string a, b;
    cin >> a >> b;
    vector<pair<int, char>> A, B;
    for (int i = 0; i < sz(a); i++) {
        A.push_back({i % 2, a[i]});
    }
    for (int i = 0; i < sz(b); i++) {
        B.push_back({i % 2, b[i]});
    }
    sort(all(A));
    sort(all(B));
    if (A == B) {
        cout << "TAK" << endl;
    } else {
        cout << "NIE" << endl;
    }
}

int main() {
    cin.sync_with_stdio(0); cin.tie(0);
    cout << fixed << setprecision(10);
    int t = 1; 
    //cin >> t;
    for (int i = 0; i < t; i++) {
        solve();
    }
}