#include <iostream> #include <algorithm> #include <climits> using namespace std; int main() { int n; int arr[100]; cin >> n; for (int i = 0; i < n; ++i) { cin >> arr[i] ; } sort(arr, arr + n); for (int i = 0; i < n; ++i) { cout << arr[i] << " "; } cout << endl; int maxV = INT_MIN; int minV = INT_MAX; for (int i = 0; i < n; ++i) { if (arr[i] < 60) { maxV = max(maxV, arr[i]); } } if (maxV == INT_MIN) { cout << "best case\n"; } else cout << maxV << '\n'; for (int i = 0; i < n; ++i) { if (arr[i] >= 60) { minV = min(minV, arr[i]); } } if (minV == INT_MAX) { cout << "worst case\n"; } else cout << minV << '\n'; return 0; }