import java.util.Scanner;
class Main{
    int n,i;
    int max = -9999999;
    int min = 9999999;
    long sam = 0;

    public void solve(){
        Scanner sc = new Scanner(System.in);
        n = sc.nextInt();
        int a[] = new int[n];
        for(i = 0; i < n; i++){
            a[i] = sc.nextInt();
            sam = sam + a[i];
            if(n == 0){
                min = 0;
                max = 0;
            }else if(n == 1){
                max = a[i];
                min = a[i];
            }else if(a[i] < min){
                min = a[i];
            }else if(a[i] > max){
                max = a[i];
            }else if(a[i] == min || a[i] == max){
                continue;
            }
           
        }
    System.out.println(min + " " + max + " " + sam);
    }
    public static void main(String[] args){
        new Main().solve();
    }
}
/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