import java.util.Scanner;

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

		int n = 0;
		int min = 0;
		int max = 0;
		long sum = 0;

		// n??\???
		n = sc.nextInt ();

		int[] a = new int[ n ];

		// a??\???
		for (int i = 0; i < n; i++ ) {
			a[ i ] = sc.nextInt ();
		}

		// ????¨??????????
		for (int j = 0; j < n; j++ ) {
			sum += a[ j ];
		}

		// ?????§?????\???
		for (int  x = 0; x < n; x++ ) {
			if ( x == 0 ) {
				max = a[ x ];
			} else {
				if ( max < a[ x ] ) {
					max = a[ x ];
				}
			}
		}

		// ????°??????????
		for (int  y = 0; y < n; y++ ) {
			if ( y == 0 ) {
				min = a[ y ];
			} else {
				if ( a[ y ] < min ) {
					min = a[ y ];
				}
			}
		}



		System.out.print ( min + " " + max + " " + sum + "\n" );
	}
}
/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