#include <bits/stdc++.h>
using namespace std;
int a[1005];
int main() {
  int n;
  cin >> n;
  int flag = 0;
  cin >> a[0];
  int qq = a[0];
  for (int i = 1; i < n; i++) {
    cin >> a[i];
    if (a[i] != qq) flag = 1;
  }
  if (flag == 0) {
    puts("Exemplary pages.");
  } else {
    int sum = accumulate(a, a + n, 0);
    if (sum % n != 0) {
      puts("Unrecoverable configuration.");
    } else {
      int ping = sum / n;
      int minng = *min_element(a, a + n);
      int minn = min_element(a, a + n) - a;
      int maxxg = *max_element(a, a + n);
      int maxx = max_element(a, a + n) - a;
      if ((minng + maxxg) / 2 != ping) {
        puts("Unrecoverable configuration.");
      } else {
        a[minn] += (-minng + maxxg) / 2;
        a[maxx] -= (-minng + maxxg) / 2;
        int qq2 = a[0];
        int flag2 = 0;
        for (int i = 1; i < n; i++) {
          if (a[i] != qq2) {
            puts("Unrecoverable configuration.");
            flag2 = 1;
            break;
          }
        }
        if (flag2 == 0) {
          printf("%d ml. from cup #%d to cup #%d.", (-minng + maxxg) / 2,
                 minn + 1, maxx + 1);
        }
      }
    }
  }
  return 0;
}
