/*
	Rozwiązanie zadania "Zabawki [C]" (ZAB) na Potyczki Algorytmiczne 2020.
	Damian Mazur
*/
#include <stdio.h>

int n;
char* ciag1;
char* ciag2;
int ciag1N[26] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 };
int ciag1P[26] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 };
int ciag2N[26] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 };
int ciag2P[26] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 };

int sprawdzCzyTabliceSaTakieSame()
{
	for (int i = 0; i < 26; i++)
	{
		if (ciag1N[i] != ciag2N[i] || ciag1P[i] != ciag2P[i])
		{
			return 0;
		}
	}
	return 1;
}

int main()
{
	scanf("%d", &n);
	ciag1 = new char[n + 1];
	ciag2 = new char[n + 1];
	scanf("%s", ciag1);
	scanf("%s", ciag2);
	int czyP = 0;
	for (int i = 0; i < n; i++)
	{
		if (czyP)
		{
			ciag1P[ciag1[i] - 97]++;
			ciag2P[ciag2[i] - 97]++;
		}
		else
		{
			ciag1N[ciag1[i] - 97]++;
			ciag2N[ciag2[i] - 97]++;
		}
		czyP = !czyP;
	}
	if (sprawdzCzyTabliceSaTakieSame())
	{
		printf("TAK");
	}
	else
	{
		printf("NIE");
	}
	return 0;
}