## 24 hour archive: Problem

###
** 3372
- Conting Edges** ** 3372 - Conting Edges** ** 3372 - Conting Edges**

#### Description

You are given a directed graph with exactly N nodes. The nodes are conveniently numbered between 1 and N. Your task is to count the number of edges of the given graph.

But this is not a ordinary graph; this is a special graph for which each node has exactly one directed edge going to their greatest proper divisor if there is one (node numbered with that value). A proper divisor of some integer number P is any divisor of P, excluding P itself. For example, 1, 2, and 3 are proper divisors of 6, but 6 itself is not.

Can you find the number of edges of the given graph if you know the amount of nodes?

But this is not a ordinary graph; this is a special graph for which each node has exactly one directed edge going to their greatest proper divisor if there is one (node numbered with that value). A proper divisor of some integer number P is any divisor of P, excluding P itself. For example, 1, 2, and 3 are proper divisors of 6, but 6 itself is not.

Can you find the number of edges of the given graph if you know the amount of nodes?

But this is not a ordinary graph; this is a special graph for which each node has exactly one directed edge going to their greatest proper divisor if there is one (node numbered with that value). A proper divisor of some integer number P is any divisor of P, excluding P itself. For example, 1, 2, and 3 are proper divisors of 6, but 6 itself is not.

Can you find the number of edges of the given graph if you know the amount of nodes?

But this is not a ordinary graph; this is a special graph for which each node has exactly one directed edge going to their greatest proper divisor if there is one (node numbered with that value). A proper divisor of some integer number P is any divisor of P, excluding P itself. For example, 1, 2, and 3 are proper divisors of 6, but 6 itself is not.

Can you find the number of edges of the given graph if you know the amount of nodes?

#### Input specification

The first line contain a integer 1 <= T <= 100 representing the amount of graphs that will be given. The next T lines contains a integer number 1 <= N <= 1000 representing the amount of nodes in the graph. Scenarios must be answered in the same order that graphs are given in the input.

#### Output specification

For each graph you must print a line containing a integer number representing the number of edges of the graph.

For each graph you must print a line containing a integer number representing the number of edges of the graph.

#### Sample input

`2`

1

3

#### Sample output

`0`

2

#### Hint(s)

http://coj.uci.cu/24h/

http://coj.uci.cu/24h/

http://coj.uci.cu/24h/