Biswa has started Borhani (kind of a soft drink) business recently and made it the new sexy in no time. He is dealing in very big numbers now and going to open branches all over the world. For each branch, he knows the maximum amount of Borhani any customer can order. As Borhani is liquid, customers order Borhani in litres and more specifically they order in positive integer quantity. For a particular branch, any quantity between 1 and the maximum limit of that branch can be ordered. Cups of different sizes are used to measure Borhani. Each cup can measure a positive quantity and Biswa has got stock of unlimited cups of each positive capacity. Now he want to send minimum number of cups to each of the branches so that all the positive quantity between 1 and the maximum limit of that branch can be measured. While measuring a particular quantity, any of the available cups in that branch can be used at most once.
First line of the test case contains a positive integer T (≤ 105) denoting the number of branches. Then in the following T lines there will be a positive integer N (1 ≤ N ≤ 1018) in each one denoting the maximum limit of that branch.
For each of the branches, the minimum number of cups required should be given as output.
3 2 3 5
2 2 3