题库练习 Longest Divisors Interval
← 上一题 下一题 →

A16135 | Longest Divisors Interval

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

Given a positive integer $n$ , find the maximum size of an interval $[l, r]$ of positive integers such that, for every $i$ in the interval (i.e., $l \leq i \leq r$ ), $n$ is a multiple of $i$ .

Given two integers $l\le r$ , the size of the interval $[l, r]$ is $r-l+1$ (i.e., it coincides with the number of integers belonging to the interval).

输入格式

The first line contains a single integer $t$ ( $1 \le t \le 10^4$ ) — the number of test cases.

The only line of the description of each test case contains one integer $n$ ( $1 \leq n \leq 10^{18}$ ).

输出格式

For each test case, print a single integer: the maximum size of a valid interval.

输入输出样例

输入 #1
10
1
40
990990
4204474560
169958913706572972
365988220345828080
387701719537826430
620196883578129853
864802341280805662
1000000000000000000
输出 #1
1
2
3
6
4
22
3
1
2
2
C++ 编辑器
输入
输出