# Andrew's Secret

**Input:**Standard Input (stdin)

**Output:**Standard Output (stdout)

**Memory limit:**100 megabytes

**Time limit:**1.0 seconds

You're a world class thief needing to break into a vault containing many many valuable treasures. However, the vault has a world class lock, and there is no hope of defeating it. Luckily, Andrew left the piece of paper containing the codes lying around. The only problem is, he's encrypted them and thats where we need you..

Andrew has encrypted the 3 number vault code by hiding it amongst another series of numbers. The first number of the vault code is the minimum number in the series of numbers. The second number of the vault code is the maximum in the series of numbers, and the third number of the vault code is the average of the series of numbers.

**Andrew has severe OCD.**

## Input Format

In each test case, you'll be given a series of 100 **integers** each separated by white space. You are guaranteed that each number n, will be 1 <= n <= 100.

### Example Input

```
37 50 37 1 24 79 87 80 66 81 63 11 13 35 77 82 86 10 76 30 22 74 68 25 92 91 67 74 98 81 83 86 30 71 38 54 49 24 85 66 56 47 28 68 33 4 50 19 65 25 100 86 50 19 62 94 10 80 67 59 60 49 44 90 19 82 95 19 57 79 36 13 77 63 32 61 18 81 31 83 58 30 20 7 49 82 52 10 13 19 68 73 19 63 14 90 96 60 8 5
```

## Output Format

For each test case, your program must output the three number vault code with a space between each number. They must be in the order, min, max, then average. If the average is fractional, you should round it down to the nearest integer.

### Example Output

```
1 100 52
```