# Become A Hero 具体用什么方式实现呢

Problem Description
Lemon wants to be a hero since he was a child. Recently he is reading a book called “Where Is Hero From” written by ZTY. After reading the book, Lemon sends a letter to ZTY. Soon he recieves a reply.

Dear Lemon,
It is my way of success. Please caculate the algorithm, and secret is behind the answer. The algorithm follows:
{
.......Count = 0;
.......For (I = 1; I <= n; I++)
.......{
..............If (LCM(I, n) < n * I)
....................Count++;
.......}
.......Return Count;
}
The LCM(m, n) is the lowest common multiple of m and n.
It is easy for you, isn’t it.
ZTY

What a good chance to be a hero. Lemon can not wait any longer. Please help Lemon get the answer as soon as possible.

Input
First line contains an integer T(1 <= T <= 1000000) indicates the number of test case. Then T line follows, each line contains an integer n (1 <= n <= 2000000).

Output
For each data print one line, the Answer(n).

Sample Input
1
1

Sample Output
0

• 写回答

#### 悬赏问题

• ¥15 如何用stata画出文献中常见的安慰剂检验图
• ¥15 c语言链表结构体数据插入
• ¥40 使用MATLAB解答线性代数问题
• ¥15 COCOS的问题COCOS的问题
• ¥15 FPGA-SRIO初始化失败
• ¥15 MapReduce实现倒排索引失败
• ¥15 ZABBIX6.0L连接数据库报错，如何解决？(操作系统-centos)
• ¥15 找一位技术过硬的游戏pj程序员
• ¥15 matlab生成电测深三层曲线模型代码
• ¥50 随机森林与房贷信用风险模型