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

#F2528. Number With The Given Amount Of Divisors

    ID: 2534 传统题 2000ms 256MiB 尝试: 0 已通过: 0 难度: 6 上传者: 标签>枚举动态规划数论算法思想数学提高难度共享题库Codeforces英文题面题目来源题面语言

Number With The Given Amount Of Divisors

题目描述

E. Number With The Given Amount Of Divisors
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Given the number n, find the smallest positive integer which has exactly n divisors. It is guaranteed that for the given n the answer will not exceed 1018.

Input

The first line of the input contains integer n (1≤n≤1000).

Output

Output the smallest positive integer with exactly n divisors.

Examples
Input
4
Output
6
Input
6
Output
12

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