#include <bits/stdc++.h>
using namespace std;
vector<int> findDuplicates(const vector<int>& nums){
    unordered_map<int,int> cnt; for(int x:nums) cnt[x]++;
    vector<int> ans; ans.reserve(cnt.size());
    for(auto &p:cnt) if(p.second>2) ans.push_back(p.first);
    return ans;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n; if(!(cin>>n)) return 0; vector<int> nums(n); for(int i=0;i<n;++i)cin>>nums[i];
    vector<int> res=findDuplicates(nums);
    for(size_t i=0;i<res.size();++i){ if(i) cout<<" "; cout<<res[i]; }
    return 0;
}

import java.io.*;
import java.util.*;
public class Main {
    public static List<Integer> findDuplicates(int[] nums){
        Map<Integer,Integer> map = new HashMap<>();
        for(int x:nums){
            map.put(x, map.getOrDefault(x,0)+1);
        }
        List<Integer> res = new ArrayList<>();
        for(Map.Entry<Integer,Integer> e: map.entrySet()){
            if(e.getValue()>2) res.add(e.getKey());
        }
        return res;
    }
    public static void main(String[] args) throws Exception{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String line = br.readLine();
        if(line==null||line.isEmpty()) return;
        int n = Integer.parseInt(line.trim());
        int[] nums = new int[n];
        StringTokenizer st = new StringTokenizer(br.readLine());
        for(int i=0;i<n;i++) nums[i]=Integer.parseInt(st.nextToken());
        List<Integer> res = findDuplicates(nums);
        for(int i=0;i<res.size();i++){
            if(i>0) System.out.print(" ");
            System.out.print(res.get(i));
        }
    }
}

import sys
def find_duplicates(nums):
    from collections import Counter
    cnt = Counter(nums)
    return [k for k,v in cnt.items() if v>2]

data = sys.stdin.read().strip().split()
if not data:
    sys.exit()
n = int(data[0])
nums = list(map(int, data[1:1+n]))
res = find_duplicates(nums)
print(' '.join(map(str,res)))

const fs = require('fs');
const data = fs.readFileSync(0,'utf8').trim().split(/\s+/).map(Number);
let idx=0;
const n = data[idx++]||0;
const nums = data.slice(idx, idx+n);
function findDuplicates(nums){
    const map = new Map();
    for(const x of nums){
        map.set(x, (map.get(x)||0)+1);
    }
    const res = [];
    for(const [k,v] of map){
        if(v>2) res.push(k);
    }
    return res;
}
const res = findDuplicates(nums);
console.log(res.join(' '));