UESTC OJ 1830

#include<iostream>
#include<vector>
#include<cstdlib>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;

bool isQuery(char s[], int &d)
{
    if (s[0] == '#') return true;
    d = 0; int len = strlen(s);
    for (int i = 0; i < len; i++)
    {
        d *= 10;
        d += s[i] - '0';
    }
    return false;
}

int main()
{
    char s[50]; int d;
    vector<int> v;
    while(scanf("%s",s)!=EOF)
    {
        if (isQuery(s, d) == true)
        {
           printf("%d\n",v[v.size()/2]);
           v.erase(v.begin()+v.size()/2);
        }
        else
        {
             v.push_back(d);
             sort(v.begin(),v.end());
        }

    }

    return 0;
}