All Tracks Math Number Theory Problem

Anmol And Divisors
Tag(s):

Easy-Medium

Problem
Editorial
Analytics

Anmol is very found of divisors . He has recently got a list of numbers from Satyam. So he want to find all the divisors of those numbers and print them in ascending order. Please help Anmol.

Note->Anmol doesn't consider 1 and that number itself as divisor of the number

Input

First line contains a number t number of test cases.

t lines follows each containing a number ai.

Output

Print t lines divisor of ith number in ith line.

Constraints

$$ t \le 1000 $$

$$ ai \le 100000000000000 $$

SAMPLE INPUT
3
4 
6
8
SAMPLE OUTPUT
2 
2 3
2 4
Time Limit: 1.0 sec(s) for each input file.
Memory Limit: 256 MB
Source Limit: 1024 KB
Marking Scheme: Marks are awarded when all the testcases pass.
Allowed Languages: C, C++, C++14, Clojure, C#, D, Erlang, F#, Go, Groovy, Haskell, Java, Java 8, JavaScript(Rhino), JavaScript(Node.js), Julia, Kotlin, Lisp, Lisp (SBCL), Lua, Objective-C, OCaml, Octave, Pascal, Perl, PHP, Python, Python 3, R(RScript), Racket, Ruby, Rust, Scala, Swift, Visual Basic

CODE EDITOR

Initializing Code Editor...
Your Rating:

Contributor

Notifications
View All Notifications