#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>

using namespace std;

int main()
{
    int n;
    int g[20];
    while (cin >> n) {
        int g_min = 101;
        int g_max = -1;
        for (int i=0;i<n;i++) {
            cin >> g[i];
            if (g[i] >= 60)
                g_min = min(g_min, g[i]);
            else
                g_max = max(g_max, g[i]);
        }

        sort(g, g+n);
        for (int i=0;i<n;i++) {
            if (i != 0) cout << " ";
            cout << g[i];
        }
        cout << endl;

        if (g_max == -1)
            cout << "best case" << endl;
        else
            cout << g_max << endl;

        if (g_min == 101)
            cout << "worst case" << endl;
        else
            cout << g_min << endl;
    }
    return 0;
}