from collections import Counter
c = input()
n = int(input())
k = []
idx = -1
mx = 0
for i in range(n):
s=input()
cnt = s.count(c)
if mx < cnt:
mx = cnt
idx = i
k.append(s)
s=sorted(k[idx])
d=Counter(s)
best=d.most_common(1)
print(*list(best[0]))
ZnJvbSBjb2xsZWN0aW9ucyBpbXBvcnQgQ291bnRlcgoKYyA9IGlucHV0KCkKbiA9IGludChpbnB1dCgpKQprID0gW10KaWR4ID0gLTEKbXggPSAwCgpmb3IgaSBpbiByYW5nZShuKToKICAgIHM9aW5wdXQoKQogICAgY250ID0gcy5jb3VudChjKQogICAgaWYgbXggPCBjbnQ6CiAgICAgICAgbXggPSBjbnQKICAgICAgICBpZHggPSBpCiAgICBrLmFwcGVuZChzKQoKcz1zb3J0ZWQoa1tpZHhdKQpkPUNvdW50ZXIocykKYmVzdD1kLm1vc3RfY29tbW9uKDEpCnByaW50KCpsaXN0KGJlc3RbMF0pKQo=