Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

Min, Max and Sum

Write a program which reads a sequence of $n$ integers $a_i (i = 1, 2, ... n)$, and prints the minimum value, maximum value and sum of the sequence.

Input

In the first line, an integer $n$ is given. In the next line, $n$ integers $a_i$ are given in a line.

Output

Print the minimum value, maximum value and sum in a line. Put a single space between the values.

Constraints

$0 < n \leq 10000$

$-1000000 \leq a_i \leq 1000000$

Sample Input

5
10 1 5 4 17

Sample Output

1 17 37

Solution in JAVA (judge verdict: Wrong Answer)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;

class Main {
	public static void main(String[] args) throws IOException {
		//BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		//String n = br.readLine();
		Scanner scanner = new Scanner(System.in);
		int  n = Integer.parseInt(scanner.nextLine());
		String[] list = scanner.next().split(" ");
		//String[] list = br.readLine().split(" ");
		System.out.println(searchMin(list) + " " + searchMax(list) + " " + sum(list));
	}

	static long searchMin(String[] list) {
		long min = 1000000;
		for (int i = 0; i < list.length; i++) {
			if (min > Integer.parseInt(list[i])) {
				min = Integer.parseInt(list[i]);
			}
		}
		return min;
	}

	static int searchMax(String[] list) {
		int max = 0;
		for (int i = 0; i < list.length; i++) {
			if (max < Integer.parseInt(list[i])) {
				max = Integer.parseInt(list[i]);
			}
		}
		return max;
	}

	static long sum(String[] list) {
		long sum = 0;
		for (int i = 0; i < list.length; i++) {
			sum = sum + Integer.parseInt(list[i]);
		}
		return sum;
	}
}