#include <bits/stdc++.h>
#define xoxo {cout<<-1<<endl;return 0;}
using namespace std;
int n,id,x;
char l,r;
deque<int> q;
vector<int> a[10];
int max(int x,int y)
{
return (a[x].size()>a[y].size()?a[x].size():a[y].size());
}
int main()
{
cin.tie(0)->sync_with_stdio(0);
cin>>n;
for (int i=0;i<n;i++){
cin>>id>>x;
a[id].push_back(x);
}
for (int i=1;i<=8;i++) sort(a[i].begin(),a[i].end());
for (int i=1;i<=8;i++) reverse(a[i].begin(),a[i].end());
if (max(5,6)>1||max(5,6)==0||max(7,8)>1||max(7,8)==0) xoxo
if (a[5].size()^a[6].size()==0||a[7].size()^a[8].size()==0) xoxo
l=(a[5].size()?'>':'<');
r=(a[7].size()?'<':'>');
n-=2;
q.push_back(a[5].size()?a[5].back():a[6].back());
while (n){
int x=q.size();
if (l=='>'){
/*if (a[3].size()&&a[4].size()){
if (a[3].back()<=a[4].back()) q.push_back(a[3].back()),a[3].pop_back(),l='>',n--;
else q.push_back(a[4].back()),a[4].pop_back(),l='<',n--;
}
else*/ if (a[3].size()) q.push_back(a[3].back()),a[3].pop_back(),l='>',n--;
else if (a[4].size()) q.push_back(a[4].back()),a[4].pop_back(),l='<',n--;
}
else {
/* if (a[2].size()&&a[1].size()){
if (a[2].back()<=a[1].back()) q.push_back(a[2].back()),a[2].pop_back(),l='<',n--;
else q.push_back(a[1].back()),a[1].pop_back(),l='>',n--;
}
else*/ if (a[2].size()) q.push_back(a[2].back()),a[2].pop_back(),l='<',n--;
else if (a[1].size()) q.push_back(a[1].back()),a[1].pop_back(),l='>',n--;
}
if (x==q.size()) xoxo
}
if (l!=r||n) xoxo
while (!q.empty()) cout<<q.front()<<" ",q.pop_front();
cout<<(a[7].size()?a[7].back():a[8].back())<<endl;
}
