#include <bits/stdc++.h>
using namespace std;
vector<int> vec;
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    int tmp;
    scanf("%d", &tmp);
    vec.push_back(tmp);
  }
  int mi = *min_element(vec.begin(), vec.end());
  int mx = *max_element(vec.begin(), vec.end());
  if (mi == mx) {
    printf("Exemplary pages.\n");
    return 0;
  }
  vector<int> vv(vec);
  sort(vec.begin(), vec.end());
  if (unique(vec.begin(), vec.end()) - vec.begin() > 3 ||
      accumulate(vv.begin(), vv.end(), 0) % n != 0) {
    printf("Unrecoverable configuration.\n");
    return 0;
  }
  if (count(vv.begin(), vv.end(), mi) != 1 ||
      count(vv.begin(), vv.end(), mx) != 1 || (mx + mi) % 2 != 0) {
    printf("Unrecoverable configuration.\n");
    return 0;
  } else {
    int st = find(vv.begin(), vv.end(), mi) - vv.begin();
    int ed = find(vv.begin(), vv.end(), mx) - vv.begin();
    printf("%d ml. from cup #%d to cup #%d.\n", (mx - mi) / 2, st + 1, ed + 1);
  }
}
