#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int main() {
	int count, elem;
	unsigned long long sum = 0;
	vector<int> vec;
	while (cin >> elem) vec.push_back((sum += elem, elem));
	sort (vec.begin(), vec.end());
	int i = 0;
	while (vec[i] == vec[0]) sum-=vec[i++];
	count = vec.size()-i;
	int j = vec.size()-1;
	while (vec[j] == vec[vec.size()-1]) sum-=vec[j--];
	j = vec.size()-1 - j;
	count -= j;
	cout << sum / count + 1 * (sum % count >= count / 2.);
	return 0;
}