#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
int n;
ll a[N];
int main() {
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
int sum1 = 0, sum2 = 0;
if (n % 2 == 0) {
for (int i = 0; i < n / 2; i++) sum1 += a[i];
for (int i = n / 2; i < n; i++) sum2 += a[i];
cout << "Outgoing #: " << n / 2 << endl;
cout << "Introverted #: " << n / 2 << endl;
cout << "Diff = " << abs(sum1 - sum2) << endl;
} else {
for (int i = 0; i < n / 2; i++) sum1 += a[i];
for (int i = n / 2; i < n; i++) sum2 += a[i];
cout << "Outgoing #: " << n / 2 + 1 << endl;
cout << "Introverted #: " << n / 2 << endl;
cout << "Diff = " << abs(sum1 - sum2) << endl;
}
return 0;
}