# hdu 4596 (数论)

//  Created by Chenhongwei on 2016-05-01 Sunday 12:24

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <queue>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <vector>
#include <sstream>
#include <algorithm>
#define root 1,n,1
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
using namespace std;
const int inf=1e9;
const int mod=1e9+7;
const int maxn=1e5+100;
typedef long long ll;
typedef unsigned long long ull;
ll n;
ll a[1100],b[1100],c[1100];
ll gcd(ll x,ll y)
{
if(y==0)
return x;
else
return gcd(y,x%y);
}
bool check(int x,int y)
{
ll tt=gcd(a[x],a[y]);
ll left=b[y]-c[x];
ll right=c[y]-b[x];
if(left%tt==0||right%tt==0)
return true;
if(left<=0&&right>=0)
return true;
if(right/tt-left/tt>=1)
return true;
return false;
}
int main()
{
//ios::sync_with_stdio(false);
// freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
while(scanf("%lld",&n)!=EOF)
{
for(int i=1;i<=n;i++)
scanf("%lld%lld%lld",&a[i],&b[i],&c[i]);
bool flag=0;
for(int i=1;i<=n;i++)
{
for(int j=i+1;j<=n;j++)
if(check(i,j))
{
flag=1;
break;
}
if(flag)
break;
}
if(!flag)
puts("Can Take off");
else
puts("Cannot Take off");
}
return 0;
}