The** Euler Totient **Function for a positive integer N is defined as the number of positive integers less than or equal to N and relatively prime to N.

For example, an algorithm to find **Euler Totient** Function value of N will be:

*int phi(unsigned int N)
{
unsigned int result = 1;
for (int i=2; i < N; i++)
if (gcd(i, N) == 1)
result++;
return result;
}*

The task is to find the **sum** of the **Euler Totient** Values of all the divisors of the given number.

**Input: **

The first line of input contains a single integer **T** denoting the number of test cases. Then **T** test cases follow. Each test case consists of a single line containing a positive integer **N**.

**Output:**

Corresponding to each test case, in a new line, print the sum of the Euler Totient Function values of all the divisors of the given number.

**Constraints:**

1 ≤ T ≤ 10000

1 ≤ N ≤ 1000000

**Example:**

**Input**

2

1

2

**Output**

1

2

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

agness | 122 |

aman1931998 | 102 |

Survivor | 100 |

uchitnitk | 96 |

lonecoder | 95 |

KshatriyaYash | 1066 |

nikhil_sojan | 1032 |

lonecoder | 1030 |

mazumderrohit8 | 899 |

SumitSingh27 | 832 |

blackshadows | 5327 |

Ibrahim Nash | 5215 |

akhayrutdinov | 5111 |

mb1973 | 4492 |

Quandray | 4444 |

Login to report an issue on this page.