// Problem#: 1052
// Submission#: 1682917
// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
// All Copyright reserved by Informatic Lab of Sun Yat-sen University
#include <stdio.h>
bool is_end(int arr[],int n)
{
for (int i = 0; i < n-1; i++)
{
if (arr[i] != arr[i+1])
return false;
}
return true;
}
int main()
{
int arr[10005];
int n;
while (scanf ("%d",&n) && n)
{
for (int i = 0; i < n; i++)
{
scanf ("%d",&arr[i]);
}
int counter = 0;
while (true)
{
int half = 0;
for (int i = 0; i < n; i++)
{
int temp = arr[i] / 2;
arr[i] = temp + half;
half = temp;
if (i != 0 && (arr[i] & 1))
arr[i] ++;
}
arr[0] += half;
if (arr[0] & 1)
arr[0]++;
counter ++;
if (is_end(arr,n))
break;
}
printf ("%d %d\n",counter,arr[0]);
}
return 0;
}