Examples:

**Input :** n = 54
**Output :** 232
Divisors of 54 = 1, 2, 3, 6, 9, 18, 27, 54.
Sum of divisors of 1, 2, 3, 6, 9, 18, 27, 54
are 1, 3, 4, 12, 13, 39, 40, 120 respectively.
Sum of divisors of all the divisors of 54 =
1 + 3 + 4 + 12 + 13 + 39 + 40 + 120 = 232.

**Input : **n = 10
**Output :** 28
Divisors of 10 are 1, 2, 5, 10
Sums of divisors of divisors are
1, 3, 6, 18.
Overall sum = 1 + 3 + 6 + 18 = 28

**Input:**

The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. Each test case contains an integer n.

**Output:**

For each test case in a new line print the required output.

**Constraints:**

1<=T<=100

1<=n<=100

**Example:
Input:**

2

54

10

232

28

Ravneet Baansal | 72 |

mhao | 44 |

anime | 33 |

Ibrahim Nash | 29 |

Divyansh Njr | 29 |

tyaglot | 447 |

taobupt | 274 |

bentlynixon | 241 |

Ravneet Baansal | 225 |

thurki | 217 |

akhayrutdinov | 3944 |

sanjay05 | 3366 |

Michael Riegger | 2119 |

Quandray | 2086 |

Jasleen Kaur 2 | 2012 |