跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2459. Empire Strikes Back

  • ID: 2465
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:挑战
  • 上传者:
  • 二分
  • 数学
  • 数论
  • 算法思想
  • 挑战
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Empire Strikes Back

题目描述

E. Empire Strikes Back
time limit per test
5 seconds
memory limit per test
512 megabytes
input
standard input
output
standard output

In a far away galaxy there is war again. The treacherous Republic made k precision strikes of power ai on the Empire possessions. To cope with the republican threat, the Supreme Council decided to deal a decisive blow to the enemy forces.

To successfully complete the conflict, the confrontation balance after the blow should be a positive integer. The balance of confrontation is a number that looks like , where p=n! (n is the power of the Imperial strike), . After many years of war the Empire's resources are low. So to reduce the costs, n should be a minimum positive integer that is approved by the commanders.

Help the Empire, find the minimum positive integer n, where the described fraction is a positive integer.

Input

The first line contains integer k (1≤k≤106). The second line contains k integers a1,a2,...,ak (1≤ai≤107).

Output

Print the minimum positive integer n, needed for the Empire to win.

Please, do not use the %lld to read or write 64-but integers in C++. It is preferred to use the cin, cout streams or the %I64d specificator.

Examples
Input
2
1000 1000
Output
2000
Input
1
2
Output
2

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 2092 题。保留原作者与原赛事署名。