#include <bits/stdc++.h>
#define ll long long
#define endl "\n"
using namespace std;
int N;
string s;
bool can(string a,int deb){
int p = deb;
int idx = 0;
bool skip=false;
while(idx<a.size()&&p<N){
if(a[idx]==s[p]){
idx++,p++;
}
else{
if(skip)
return false;
skip=true;
p++;
}
}
return true;
}
void solve(){
cin >> N;
cin >> s;
vector<int> occ(26,0);
for(int i=0;i<N;i++){
occ[s[i]-'A']++;
}
int cntodd=0;
for(int i=0;i<26;i++){
cntodd += occ[i]%2;
}
if(cntodd!=1){
cout << "NOT POSSIBLE" << endl;
return;
}
string a="",b="";
for(int i=0;i<N/2;i++){
a+=s[i];
}
for(int i=N/2+1;i<N;i++){
b+=s[i];
}
if(can(a,N/2)&&can(b,0)){
cout << "NOT UNIQUE" << endl;
}
else{
if(can(a,N/2)){
cout << a << endl;
}
else{
assert(can(b,0));
cout << b << endl;
}
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int t=1;
//cin >> t;
while(t--){
solve();
}
}
