#include <bits/stdc++.h>
#define int long long
using namespace std;
int n,as[1010],cnt,a[1010];
struct node{
	int ko,l,r,y,x,f;
	string s;
}k[1010];
int jude(int x){
	int y=0;
	for(int i=2;i<=n+1;i++){
		if(k[i].y)y=k[i].y;
		if(k[i].l){
			if(k[i].f==-1&&x>=k[i].x){
				i=k[i].r;
				continue;
			}
			if(k[i].f==1&&x<=k[i].x){
				i=k[i].r;
				continue;
			}
		}
	}
	return y;
}
signed main(){
	cin>>n;
	for(int i=1;i<=n+1;i++){
		getline(cin,k[i].s);
		int l=k[i].s.size();
	//	cout<<l<<endl;
		for(int j=0;j<l;j++){
			if(k[i].s[j]=='i')k[i].l=i;
			if(k[i].s[j]!=' ')break;
			else k[i].ko++;
		}
		if(k[i].s[l-1]=='}'&&k[i].ko!='i'){
			for(int j=i-1;j>=1;j--){
				if(k[j].ko==k[i].ko){
					if(k[j].s[k[j].ko]=='i')k[j].r=i;
				}
			}
		}
		if(k[i].s[k[i].ko]=='y'){
			int l=k[i].ko+4;
			int r=k[i].s.size()-1;
			int sum=0;
			for(int j=l;j<r;j++){
				sum=sum*10+k[i].s[j]-'0';
			}
			k[i].y=sum;
		}
		if(k[i].s[k[i].ko]=='i'){
			if(k[i].s[k[i].ko+6]=='>')k[i].f=1;
			else k[i].f=-1;
			int l=k[i].ko+8;
			int r=k[i].s.size()-3,sum=0;
			for(int j=l;j<r;j++)sum=sum*10+k[i].s[j]-'0';
			k[i].x=sum;
			as[++cnt]=sum+k[i].f;
		}
	}
//	for(int i=2;i<=n+1;i++)cout<<k[i].x<<" "<<k[i].f<<endl;
	for(int i=1;i<=cnt;i++)a[i]=jude(as[i]);
	sort(a+1,a+cnt+1);
	cout<<0<<" ";
	for(int i=1;i<=cnt;i++){
		if(a[i]!=a[i-1])cout<<a[i]<<" ";
	}
	return 0;
}