yru8768o0

#include <iostream>
#include <unordered_set>
#include <vector>
using namespace std;

int main() {
int n;
cin >> n;
vector<int> nums(n);
unordered_set<int> seen;
vector<int> result;

for (int i = 0; i < n; ++i) {
    cin >> nums[i];
    if (seen.find(nums[i]) == seen.end()) {
        result.push_back(nums[i]);
        seen.insert(nums[i]);
    }
}

for (int i = 0; i < result.size(); ++i) {
    if (i != 0) cout << " ";
    cout << result[i];
}
return 0;

}