# CodeChef - Finding Square Roots

**Problem**

In the olden days finding square roots seemed to be difficult but nowadays it can be easily done using in-built functions available across many languages.

Assume that you happen to hear the above words and you want to give a try in finding the square root of any given integer using in-built functions. So here's your chance.

**Input**

The first line of the input contains an integer `T`

, the number of test cases. `T`

lines follow. Each line contains an integer `N`

whose square root needs to be computed.

**Output**

For each line of the input, output the square root of the input integer, rounded down to the nearest integer, in a new line.

**Constraints**

- 1 <= T <= 20
- 1 <= N <= 10000

## Solution in Java:

```
import java.util.*;
import java.lang.*;
import java.io.*;
/* Name of the class has to be "Main" only if the class is public. */
class Codechef
{
public static void main (String[] args) throws java.lang.Exception
{
Scanner input = new Scanner(System.in);
int t = input.nextInt();
while(t-- > 0) {
int n = input.nextInt();
System.out.println((int)Math.sqrt(n));
}
}
}
```