#include <bits/stdc++.h>
using namespace std;
#define int long long
mt19937_64 rng(std::chrono::system_clock::now().time_since_epoch().count());

bool solve(int a, int b, int c, int d, vector<int>&x, vector<int>&y){
	int n = x.size();
	// can (a,b) move two moves to capture (c,d)
	map<pair<int,int>,int>hm;

	for(int i = 0; i<n; i++){
		hm[{a+x[i],b+y[i]}] = 1;
	}
	if(hm.count({c,d}))return true;
	for(int i = 0; i<n; i++){
		if(hm.count({c-x[i],d-y[i]})){
			return true;
		}
	}
	return false;
}
signed main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	int n;
	cin >> n;
	vector<int>x(n);
	vector<int>y(n);
	int a,b,c,d;
	cin >> a >> b >> c >> d;
	for(int i = 0; i<n; i++){
		cin >> x[i] >> y[i];
	}
	if(solve(a,b,c,d,x,y)){
		cout << "Alice wins\n";
		return 0;
	}
	for(int iters = 0; iters<30; iters++){
		int ax = c; int ay = d;
		while(ax == c && ay == d){
			ax = rng()%n+1;
			ay = rng()%n+1;
		}
		if(solve(c,d,ax,ay,x,y)){
			continue;
		}
		cout << "tie " << ax << ' ' << ay << endl;
		return 0;
	}
	cout << "Bob wins\n";
	return 0;
}