#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include // C++ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include //#include //#include #define rep(i,j,k) for(int i=(int)j;i<(int)k;i++) #define ll long long #define Sort(v) sort(all(v)) #define INF 1000000000 #define END return 0 #define pb push_back #define se second #define fi first #define pb push_back #define all(v) (v).begin() , (v).end() #define MP make_pair #define MOD 1000000007LL; using namespace std; int day[12]={31,28,31,30,31,30,31,31,30,31,30,31}; bool isPrime(int x){ if(x==1)return false; if(x==2)return true; if(x%2==0)return false; for(int i=0;i*i<=x;i++)if(x%i==0)return false; return true; } int main (){ int n; cin>>n; string s; cin>>s; unsigned ll cost=15,handcost=150; unsigned ll have=0; bool have_hand=false; int plus=1; rep(i,0,n){ if(handcost<=have){ if(!have_hand){ cout<<"buy hand"<>s; } return 0; } /* 10 9 4 4 3 1 1 4 2 2 4 5 8 4 0 5 3 0 5 5 2 0 */