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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
/* -----------------------
Autor: Tomasz Boguslawski
-------------------------- */
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<fstream>
#include<iomanip>
#include<string>
#include<sstream>
#include<cstring>
#include<map>
#include<vector>
#include<set>
#include<queue>
#include<algorithm>
#include <fstream>
#include<math.h>

#define FOR(x, b, e) for(long x = b; x <= (e); x++)
#define FORD(x, b, e) for(long x = b; x >= (e); x--)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define DEBUG if (debug)
#define MIN(a,b) ((a>b)?b:a)
#define MAX(a,b) ((a>b)?a:b)
#define LL long long

#define DEBUGMODE true

using namespace std;

class Slowo
{
    public:
    int c[30];
    Slowo()
    {
        FOR(i,0,29) c[i]=0;
    }
    void addLetter(char lett)
    {
        c[(int)lett-97]++;
    }
};


/// MAIN
int main(int argc, char* argv[])
{
    // magic formula, which makes streams work faster:
	ios_base::sync_with_stdio(0);
    int n;
    string s1,s2;
    cin >> n; cin >> s1; cin >> s2;

    Slowo slo1, slo2; char ch1, ch2;
    int p=1;
    while (p<=n)
    {
        ch1=s1[p-1]; ch2=s2[p-1];
        slo1.addLetter(ch1); slo2.addLetter(ch2);
        //cout << p << ":" << ch1 << " / " << ch2 << "\n";
        p+=2;
    };
    FOR(i,0,29) if (slo1.c[i]!=slo2.c[i]) { cout << "NIE\n"; return 0; }

    Slowo slo3, slo4;
    p=2;
    while (p<=n)
    {
        ch1=s1[p-1]; ch2=s2[p-1];
        slo3.addLetter(ch1); slo4.addLetter(ch2);
        //cout << p << ":" << ch1 << " / " << ch2 << "\n";
        p+=2;
    };
    FOR(i,0,29) if (slo3.c[i]!=slo4.c[i]) { cout << "NIE\n"; return 0; }

    cout << "TAK\n";
    return 0;
};