#include <bits/stdc++.h>
using namespace std;
int main( ) {
int n,a,b;
int q,s,p;
while ( cin >> n) {
queue< int > Q;
stack< int > S;
priority_queue< int > P;
q= 1 ;
s= 2 ;
p= 3 ;
while ( n-- ) {
cin >> a>> b;
if ( a== 1 ) {
Q.push ( b) ;
S.push ( b) ;
P.push ( b) ;
}
else if ( a== 2 ) {
if ( ! Q.empty ( ) && Q.front ( ) == b) Q.pop ( ) ;
else q= 0 ;
if ( ! S.empty ( ) && S.top ( ) == b) S.pop ( ) ;
else s= 0 ;
if ( ! P.emty ( ) && P.top ( ) == b) P.pop ( ) ;
else p= 0 ;
}
}
int ans= max( max( q,p) , s) ;
if ( ! ans) cout << "impossible" << endl;
else if ( ( q&& p) || ( q&& s) || ( s&& p) || ( q&& p&& s) ) cout << "not sure" << endl;
else if ( q) cout << "queue" << endl;
else if ( s) cout << "stack" << endl;
else if ( p) cout << "priority queue" << endl;
}
return 0 ;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBtYWluKCkgewoJaW50IG4sYSxiOwoJaW50IHEscyxwOwoJd2hpbGUoY2luPj5uKXsKCXF1ZXVlPGludD4gUTsKCXN0YWNrPGludD4gUzsKCXByaW9yaXR5X3F1ZXVlPGludD4gUDsKCQlxPTE7CgkJcz0yOwoJCXA9MzsKCQl3aGlsZShuLS0pewoJCQljaW4+PmE+PmI7CgkJCWlmKGE9PTEpewoJCQkJUS5wdXNoKGIpOwoJCQkJUy5wdXNoKGIpOwoJCQkJUC5wdXNoKGIpOwoJCQl9CgkJCWVsc2UgaWYoYT09Mil7CgkJCQlpZighUS5lbXB0eSgpJiZRLmZyb250KCk9PWIpUS5wb3AoKTsKCQkJCWVsc2UgcT0wOwoJCQkJaWYoIVMuZW1wdHkoKSYmUy50b3AoKT09YilTLnBvcCgpOwoJCQkJZWxzZSBzPTA7CgkJCQlpZighUC5lbXR5KCkmJlAudG9wKCk9PWIpUC5wb3AoKTsKCQkJCWVsc2UgcD0wOwoJCQl9CgkJfQoJCWludCBhbnM9bWF4KCBtYXgocSxwKSAsIHMpOwoJCQlpZighYW5zKWNvdXQ8PCJpbXBvc3NpYmxlIjw8ZW5kbDsKCQkJZWxzZSBpZigocSYmcCl8fChxJiZzKXx8KHMmJnApfHwocSYmcCYmcykpY291dDw8Im5vdCBzdXJlIjw8ZW5kbDsKCQkJZWxzZSBpZihxKWNvdXQ8PCJxdWV1ZSI8PGVuZGw7CgkJCWVsc2UgaWYocyljb3V0PDwic3RhY2siPDxlbmRsOwoJCQllbHNlIGlmKHApY291dDw8InByaW9yaXR5IHF1ZXVlIjw8ZW5kbDsKCX0KCXJldHVybiAwOwp9