#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
 
using namespace std;
 
vector<long long>vec;
 
int main()
{
    long long n,i,counter=1,a;
 
    while(scanf("%lld",&n)==1)
    {
        vec.push_back(n);
 
        sort(vec.begin(),vec.end());
 
 
        if(counter%2==0)
        {
            a=counter/2;
            printf("%lld\n",(vec[a]+vec[a-1])/2);
        }
        else
        {
            a=counter/2;
            printf("%lld\n",vec[a]);
        }
 
        counter++;
    }
 
    return 0;
}