Unlock The Lock

You have a lock that has value N. You have infinite number of keys, each having value $1,2,3,4,\dots $ You can unlock lock with key such that lock's value is divisible by key's value. Find total no of keys that can be used to unlock the lock. ###Input: - First line of input is number of testcases $t$ $(1 \le t \le 10)$ - Each testcase contain only integer $n$ $(1 \le n \le 10^9)$.