#include <iostream>
#include <algorithm>
#include <set>
#include <string>
#include <vector>
#include <cmath>
#include <map>

using namespace std;

set<string> skek(string(t)) {
    set<string> s1;
    string a = "";
    for (auto i : t) {
        if (i == ' ') {
            s1.insert(a);
            a = "";
        } else {
            a += i;
        }
    }
    s1.insert(a);
    return s1;

}

void vkek(set<string> s) {
    for (auto i : s) {
	        cout << i << " ";
	    }
}

int main() {
	set<string> s, s1, s2;
	string t = "X", a = "", koko;
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++) {
	    s.insert(to_string(i));
	}
	while (1 == 1) {
	    getline(cin, koko);
	    getline(cin, t);
    	if (t[0] != 'H') {
    	    s1 = skek(t);
        	cin >> t;
        	if (t == "YES") {
        	   set_intersection(s.begin(), s.end(), s1.begin(), s1.end(),inserter(s2, s2.begin()));;
        	    s.swap(s2);
        	    s2.clear();
        	} else {
        	    set_difference(s.begin(), s.end(), s1.begin(), s1.end(),inserter(s2, s2.begin()));
        	    s.swap(s2);
        	    s2.clear();
        	}
	    } else {
	        vkek(s);
	        return 0;
	    }
	}
}