void solve(ll &T) { ll n; cin>>n; queue q; for(ll i=0; i>p; q.push(p); } map coin; while(!q.empty()) { ll p = q.front(); q.pop(); if(p == 5) { coin[5]++; } else if(p == 10 and coin[5]) { coin[5]--; coin[10]++; } else if(p == 15) { if(coin[10]) { coin[10]--; coin[15]++; } else if(coin[5] >= 2) { coin[5] -= 2; coin[15]++; } else { cout<<"NO\n"; return; } } else { cout<<"NO\n"; return; } } cout<<"YES\n"; }