#include<bits/stdc++.h>
#define ll long long int
#define vec vector<ll>
#define f(var,a,b) for(ll var = a ; var < b ; var++ )
#define fasthoja ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
void att1( vec &v , ll x ) {
ll n = v.size();
sort( v.begin() , v.end() ); // sorting the given array
// Applying 2 pointer
ll left = 0, right = n-1;
bool isAC = false;
while( left < right ) {
if( v[left] + v[right] == x ) {
isAC = true;
break;
}
else if( v[left] + v[right] > x ) {
right--;
}
else if( v[left] + v[right] < x ) {
left++;
}
}
if( isAC ) cout << "Accepted\n";
else cout << "Rejected\n";
}
int main(void){
fasthoja;
ll t; cin>>t;
while(t--){
ll n; cin >> n;
ll x = 2000;
vec v(n); f(i,0,n) cin >> v[i];
att1( v , x);
}//end of test case loop
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KI2RlZmluZSBsbCBsb25nIGxvbmcgaW50CiNkZWZpbmUgdmVjIHZlY3RvcjxsbD4KI2RlZmluZSBmKHZhcixhLGIpIGZvcihsbCB2YXIgPSBhIDsgdmFyIDwgYiA7IHZhcisrICkKI2RlZmluZSBmYXN0aG9qYSBpb3NfYmFzZTo6c3luY193aXRoX3N0ZGlvKGZhbHNlKTsgY2luLnRpZShOVUxMKTsKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCnZvaWQgYXR0MSggdmVjICZ2ICwgbGwgeCApIHsKCWxsIG4gPSB2LnNpemUoKTsKCQoJc29ydCggdi5iZWdpbigpICwgdi5lbmQoKSApOyAvLyBzb3J0aW5nIHRoZSBnaXZlbiBhcnJheQoJCi8vCUFwcGx5aW5nIDIgcG9pbnRlciAKCWxsIGxlZnQgPSAwLCByaWdodCA9IG4tMTsKCWJvb2wgaXNBQyA9IGZhbHNlOwoJCgl3aGlsZSggbGVmdCA8IHJpZ2h0ICkgewoJCWlmKCB2W2xlZnRdICsgdltyaWdodF0gPT0geCApIHsKCQkJaXNBQyA9IHRydWU7CgkJCWJyZWFrOwoJCX0KCQllbHNlIGlmKCB2W2xlZnRdICsgdltyaWdodF0gPiB4ICkgewoJCQlyaWdodC0tOwoJCX0KCQllbHNlIGlmKCB2W2xlZnRdICsgdltyaWdodF0gPCB4ICkgewoJCQlsZWZ0Kys7CgkJfQkJCgl9CglpZiggaXNBQyApIGNvdXQgPDwgIkFjY2VwdGVkXG4iOwoJZWxzZSBjb3V0IDw8ICJSZWplY3RlZFxuIjsKfQoKaW50IG1haW4odm9pZCl7CgkKICAgIGZhc3Rob2phOwogICAgbGwgdDsgY2luPj50OwoKICAgIHdoaWxlKHQtLSl7CiAgICAJCiAgICAJbGwgbjsgY2luID4+IG47CiAgICAJbGwgeCA9IDIwMDA7CiAgICAJdmVjIHYobik7IGYoaSwwLG4pIGNpbiA+PiB2W2ldOwogICAgCWF0dDEoIHYgLCB4KTsKIAogICAgfS8vZW5kIG9mIHRlc3QgY2FzZSBsb29wCgogcmV0dXJuIDA7Cn0K