// http://www.spoj.com/problems/WILLITST/
#include <iostream>
using namespace std;
int main() {
unsigned long long int t;
cin >> t;
if((t&(t-1))==0) //checks for 2^n
cout << "TAK" << endl;
else
cout << "NIE" << endl;
}
SPOJ WILLITST
最新推荐文章于 2022-08-23 16:32:57 发布