int pre = 0;
while (true)
{
    int cur = max(0, k / n - pre);
    if (cur == 0) break;
    k += cur;
    pre += cur;
}

cout << k << endl;
return 0;

cin>>n;
T.resize(n+1);

FOR(i,1,n+1)
{
    cin>>a;
    T[i] = T[i-1] + a;
}

LL MAX = -9999999999;

FOR(i,1,n+1)
{
    FOR(j,i,n+1)
    {
        if((j-i+1)%3 == 0)
        {
            LL t = T[j] - T[i-1];
            MAX = max(t,MAX);
        }
    }
}

cout<<MAX<<endl;

return 0;