1.1 KB | 1095 chars
"""
[32500: Dishonest Lottery](https://www.acmicpc.net/problem/32500)
Tier: Bronze 3
Category: implementation
"""
import sys
from math import sqrt, pi, sin, factorial, ceil, floor
from datetime import datetime, timedelta
SYS_INPUT = True
RECURSION_LIMIT = 10 ** 7
SET_RECURSION = False
BLANK = " "
if SET_RECURSION:
sys.setrecursionlimit(RECURSION_LIMIT)
inp = lambda : sys.stdin.readline().rstrip() if SYS_INPUT else input()
mii = lambda : [*map(int,inp().split())]
mfi = lambda : [*map(float,inp().split())]
ii = lambda : int(inp())
fi = lambda : float(inp())
isplit = lambda : inp().split()
p = print
def gcd(a, b): return gcd(b, a % b) if b > 0 else a
def lcm(a, b): return a * b // gcd(a, b)
def solve():
n = ii()
l = [mii() for _ in range(10 * n)]
l = [j for i in l for j in i]
ans = []
cnt = {}
for i in l:
cnt[i] = cnt.get(i, 0) + 1
for i in cnt:
if cnt[i] > n * 2:
ans.append(i)
ans.sort()
if len(ans):
print(*ans)
else:
print(-1)
if __name__ == "__main__":
tc = 1
for t in range(1, tc+1):
ret = solve()