#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define endl '\n'
struct custom_hash {
typedef unsigned long long ull;
const ull FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
static ull splitmix64(ull x) {
// http://xorshift.di.unimi.it/splitmix64.c
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(ll x) const {
return splitmix64(x + FIXED_RANDOM);
}
size_t operator()(const pair<int,int> &i)const{
return splitmix64((((ll)i.first)^(((ll)i.second)<<32))+FIXED_RANDOM);
}
};
int n;
string sides;
set<int> al[200005];
struct trip{
int a,b,c;
trip (int _a,int _b,int _c){
a=_a,b=_b,c=_c;
}
};
vector<trip> tri;
unordered_map<ii,char,custom_hash> color;
bool dfs(int i,int j){
//cout<<i<<" "<<j<<endl;
//note here that it returns true if triangulation does not exist
if ((j+1)%n==i){
al[i].erase(j);
al[j].erase(i);
return false;
}
else{
auto curr=al[i].find(j);
auto it=(curr==(--al[i].end()))?al[i].begin():next(curr);
int temp=*it;
//cout<<"DEBUG: "<<i<<" "<<*it<<" "<<j<<endl;
tri.push_back(trip(i,j,*it));
if (i<j && i<temp && temp<j) return true;
if (j<i && (i<temp || temp<j)) return true;
if (!al[j].count(temp)) return true;
al[i].erase(j);
al[j].erase(i);
if (dfs(i,temp)||dfs(temp,j)) return true;
return false;
}
}
int main(){
//freopen("input.txt","r",stdin);
ios::sync_with_stdio(0);
cin.tie(0);
cin>>n; //bye bye
cin>>n;
cin>>sides;
for (int x=0;x<n;x++){
al[x].insert((x+1)%n);
al[(x+1)%n].insert(x);
color[ii(x,(x+1)%n)]=sides[x];
color[ii((x+1)%n,x)]=sides[x];
}
int a,b;
char c;
for (int x=3;x<n;x++){
cin>>a>>b>>c;
a--,b--;
al[a].insert(b);
al[b].insert(a);
color[ii(a,b)]=c;
color[ii(b,a)]=c;
}
if (dfs(0,1)){
cout<<"neispravna triangulacija";
return 0;
}
//now we check for legit colours
for (auto &it:tri){
//cout<<it.a<<" "<<it.b<<" "<<it.c<<endl;
//cout<<color[ii(it.a,it.b)]<<" "<<color[ii(it.b,it.c)]<<" "<<color[ii(it.c,it.a)]<<endl;
if (color[ii(it.a,it.b)]==color[ii(it.a,it.c)] ||
color[ii(it.b,it.a)]==color[ii(it.b,it.c)] ||
color[ii(it.c,it.a)]==color[ii(it.c,it.b)] ){
cout<<"neispravno bojenje";
return 0;
}
}
cout<<"tocno";
}
//neispravna triangulacija -2
//neispravno bojenje -1
//tocno 0
