// Arup Guha
// 6/7/2023
// Solution to Kattis Problem: Statistics
// For SI@UCF CP camp - requires use of functions for class

using namespace std;
#include <iostream>
#include <vector>

int minV(const vector<int>& a);
int maxV(const vector<int>& a);

int main() {

    // Process cases.
    int n, tmp, cnt = 1;
    while (cin >> n) {

        // Read in values to a vector.
        vector<int> vals;
        for (int i=0; i<n; i++) {
            cin >> tmp;
            vals.push_back(tmp);
        }

        // Get min and max.
        int low = minV(vals);
        int high = maxV(vals);

        // Output the results.
        cout <<"Case " << cnt << ": " << low << " " << high << " " << high-low << endl;
        cnt++;
    }
    return 0;
}

// Returns the min item of list.
int minV(const vector<int>& a) {

    int res = a[0];
    for (int i=1; i<a.size(); i++)
        if (a[i]<res)
            res = a[i];
    return res;
}

// Returns the min item of list.
int maxV(const vector<int>& a) {
    int res = a[0];
    for (int i=1; i<a.size(); i++)
        if (a[i]>res)
            res = a[i];
    return res;
}