/*
 * author: pavveu
 * task: Potyczki Algorytmiczne 2020 Runda 2 - Zabawki [C] 
*/

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;

#define FOR(iter, val) for(int iter = 0; iter < (val); iter++)
#define all(x) begin(x), end(x)

void go() {
	int n; cin >> n;
	string a, b;
	cin >> a >> b;

	const int ASCII_MAX { 1<<8 };

	// count letters on odd and even positions
	int a_parity_cnt[2][ASCII_MAX] = { 0 };
	int b_parity_cnt[2][ASCII_MAX] = { 0 };
	int odd{};

	odd = 0;
	for ( char x : a ) {
		a_parity_cnt[odd][(int) x]++;
		odd ^= 1;
	}

	odd = 0;
	for ( char x : b ) {
		b_parity_cnt[odd][(int) x]++;
		odd ^= 1;
	}

	bool possible = true;
	FOR(parity, 2) {
		FOR(x, ASCII_MAX) {
			if ( a_parity_cnt[parity][x] != b_parity_cnt[parity][x] ) possible = false;
		}
	}
	
	cout << (possible? "TAK" : "NIE") << endl;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	go();

	return 0;
}