1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
#include <bits/stdc++.h>
 
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long LL;
typedef pair<int,int> PI; 
typedef pair<LL,LL> PLL;
typedef unsigned long long ULL;
typedef pair<double,double> PD;
 
#define FOR(x, b, e) for(int x = b; x<= (e); x++)
#define FORD(x, b, e) for(int x = b; x>= (e); x--)
#define REP(x, n) for(int x = 0; x<(n); ++x)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
 
#define PB push_back
#define IN insert
#define ST first
#define ND second
#define INF 2000000011
#define MOD 1000000007

#define MAXS 30

int zlicz[MAXS][2];
int zlicz2[MAXS][2];

bool go(){
    int n;
    cin>>n;
    string s1,s2;
    cin>>s1>>s2;
    REP(i,n)
        zlicz[s1[i]-'a'][i%2]++;
    
    REP(i,n)
        zlicz2[s2[i]-'a'][i%2]++;
    REP(i,30){
        REP(k,2){
            if(zlicz[i][k]!=zlicz2[i][k])
                return false;
        }
    }
    return true;
}
int main(){
    cout<<(go()?"TAK\n":"NIE\n");
}