#include <bits/stdc++.h>
typedef long long int ll;

#define endl            '\n'
#define pb             push_back
#define fill(x, y)     memset(x, y, sizeof(x))
#define all(x)         (x).begin(), (x).end()
#define debug(x)       { cerr << #x << " = " << x << endl; }
#define IO	       { ios_base::sync_with_stdio(false); cin.tie(0); }
#define read(x)	       freopen(x, "r", stdin)
#define write(x)       freopen(x, "w", stdout)
#define int long long
using namespace std;

typedef pair<ll, ll> ii;
typedef vector<ll>    vi;

const double inf = 1e19;
const double pi = acos(-1);



void solve() {
    mt19937 mt(time(nullptr)); 
    int n;
    cin >> n;
    int ax, ay;
    cin >> ax >> ay;
    int bx, by;
    cin >> bx >> by;

    vector<ii> moves(n);
    for (int i=0; i<n; i++) {
        cin >> moves[i].first >> moves[i].second;
    }

    moves.push_back({0, 0});

    set<ii> b_reach;
    for (int i=0; i<moves.size(); i++) {
        int x = bx - moves[i].first, y = by - moves[i].second;
        if (x > 0 and x<=n and y > 0 and y<=n) b_reach.insert({x, y});
    }
    for (int i=0; i<moves.size(); i++) {
        int x = ax + moves[i].first, y = ay + moves[i].second;
        if (b_reach.count({x, y}) > 0) {
            cout << "Alice wins" << endl;
            return;
        }
    }
    if (n < 20) {
        vector<vector<bool>> vis(n+1, vector<bool>(n+1));
        for (int i=0; i<moves.size(); i++) {
            for (int j=0; j<moves.size(); j++) {
                int x = bx + moves[i].first, y = by + moves[i].second;
                if (x > 0 and x<=n and y > 0 and y<=n) {
                    x += moves[j].first;
                    y += moves[j].second;
                    if (x > 0 and x<=n and y > 0 and y<=n) vis[x][y] = 1;
                }
            }
        }
        for (int i=1; i<=n; i++) {
            for (int j=1; j<=n; j++) {
                if (!vis[i][j]) {
                    cout << "tie " << i <<  " " << j << endl;
                    return;
                }
            }
        }
        cout << "Bob wins" << endl;
        return;
    } 

    while(1) {
        int px = (mt() % n) + 1;
        int py = (mt() % n) + 1;
        b_reach.clear();
        for (int i=0; i<moves.size(); i++) {
            int x = bx + moves[i].first, y = by + moves[i].second;
            if (x > 0 and x<=n and y > 0 and y<=n) b_reach.insert({x, y});
        }
        bool f = 1;
        for (int i=0; i<moves.size(); i++) {
            int x = px - moves[i].first, y = py - moves[i].second;
            if (b_reach.count({x, y}) > 0) {
                f = 0;
            }
        }
        if (f) {
            cout << "tie " << px << " " << py << endl;
            return ;
        }
    }

}

signed main() {
    //IO;
    cout << fixed << setprecision(10);
    solve();
}