#include #include #include enum { Cap = 25 }; static int ring[Cap]; static size_t index; static void push(int x) { ring[index++ % Cap] = x; } static int valid(int x) { for (int i = 0; i < Cap; ++i) { for (int j = 0; j < Cap; ++j) { if (ring[i] == ring[j]) continue; if (ring[i] + ring[j] == x) return 1; } } return 0; } int main(void) { int x; int list[1024]; int len = 0; while (EOF != scanf("%d\n", &x)) { list[len++] = x; } int invalid = 0; for (int i = 0; i < len; ++i) { if (index < Cap || valid(list[i])) { push(list[i]); } else { printf("%d\n", list[i]); invalid = list[i]; break; } } for (int i = 0; i < len; ++i) { int sum = 0, min = INT_MAX, max = INT_MIN; for (int j = i; j < len; ++j) { if (list[j] < min) min = list[j]; if (list[j] > max) max = list[j]; sum += list[j]; if (sum == invalid) { printf("%d\n", min + max); return 0; } } } }