#include <vector>
#include <list>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <cstdio>
#include <climits>
#include <complex>
#include <cstdint>
#include <tuple>

#define M_PI       3.14159265358979323846

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
inline int readInt() { int x; scanf("%d", &x); return x; }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;

//container util

//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a)*(a))
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
struct Edge {
    int to, cost;
    Edge(int to, int cost): to(to), cost(cost) {}
};

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<Edge>> AdjList;
AdjList graph;

const int INF = 100000000;

LL N, M;


int main() {
    //cout << fixed << setprecision(15);

    int n;
    while(cin >> n){
        if(n==0) break;

        int arr[26]={0};
        vector<char> v;
        //nokori n-(i+1)
        int maxV = 0;
        bool passed = false;
        char maxc = 0;
        int cnt[26]={0};
        int t = 0;
        for(int i=0; i<n; ++i){
            char c; cin >> c;
            cnt[c-'A']++;
            t = max(t, cnt[c-'A']);
            v.push_back(c);
        }
        int cnt2[110]={0};

        for(int i=0; i<26; ++i){
            cnt2[cnt[i]]++;
        }

        if(cnt2[t] >= 2){
            cout << "TIE" << endl;
            continue;
        }

        for(int i=0; i<n; ++i){
            arr[v[i]-'A']++;
            if(maxV < arr[v[i]-'A']){
                maxV = arr[v[i]-'A'];
                maxc = v[i];
            }
            bool j = true;

            for(int k=0; k<26; ++k){
                if(maxc-'A' == k) continue;
                if(arr[k]+n-(i+1) >= maxV) {
                    j = false;
                    break;
                }
            }

            if(j){
                cout << maxc << " " << i+1 << endl;
                passed = true;
                break;
            }
        }

        if(!passed){
            cout << "TIE" << endl;
        }

    }
    return 0;
}


Measured memory_bytes: 3088