1730: Max Factor

内存限制:128 MB 时间限制:1.000 S
评测方式:文本比较 命题人:
提交:19 解决:8

题目描述

To improve the organization of his farm, Farmer John labels each of his N (1 <= N <= 5,000) cows with a distinct serial number in the range 1..20,000. Unfortunately, he is unaware that the cows interpret some serial numbers as better than others. In particular, a cow whose serial number has the highest prime factor enjoys the highest social standing among all the other cows. (Recall that a prime number is just a number that has no divisors except for 1 and itself. The number 7 is prime while the number 6, being divisible by 2 and 3, is not). Given a set of N (1 <= N <= 5,000) serial numbers in the range 1..20,000, determine the one that has the largest prime factor.

输入

* Line 1: A single integer, N * Lines 2..N+1: The serial numbers to be tested, one per line.

输出

* Line 1: The integer with the largest prime factor. If there are more than one, output the one that appears earliest in the input file.

样例输入 复制

4
36
38
40
42

样例输出 复制

38

提示

OUTPUT DETAILS: 19 is a prime factor of 38. No other input number has a larger prime factor.