import java.util.Scanner;

public class Main{

	static long min(int[] a){
		long minValue=a[0];
		for(int i=1;i<a.length;i++){
			if(a[i]<minValue){
				minValue=a[i];
			}
		}
		return minValue;
	}

	static long max(int[] a){
		long maxValue=a[0];
		for(int i=1;i<a.length;i++){
			if(maxValue<a[i]){
				maxValue=a[i];
			}
		}
		return maxValue;
	}
	static long sum(int[] a){
		long sumValue=0;
		for(int i=0;i<a.length;i++){
			sumValue+=a[i];
		}
		return sumValue;
	}

	public static void main(String[] args){
		Scanner scan=new Scanner(System.in);

		int n=scan.nextInt();

		if(0<n){
			int[] a=new int[n];


			for(int i=0;i<n;i++){
				a[i]=scan.nextInt();
			}

			System.out.printf("%d %d %d\n",min(a),max(a),sum(a));
		}else{
			System.out.println("0 0 0");
		}
		scan.close();
	}
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz