#include <iostream>
#include <map>
using namespace std;

int main() {
	int count = 0, elem;
	unsigned long long sum = 0;
	map<int, int> MAP;
	while (cin >> elem) {
		if (MAP.find(elem) == MAP.end()) MAP[elem] = 1;
		else MAP[elem]++;
		sum += elem;
		count++;
	}
	sum -= MAP.begin()->first * MAP.begin()->second + (--MAP.end())->first * (--MAP.end())->second;
	count -= MAP.begin()->second + (--MAP.end())->second;
	cout << sum / count + 1 * (sum % count > count / 2);
	return 0;
}