#include <bits/stdc++.h>
                            #include<iostream>
                            #include<cstdio>
                            #include<vector>
                            #include<queue>
                            #include<map>
                            #include<cstring>
                            #include<string>
                            #include <math.h>
                            #include<algorithm>
                        //    #include <boost/multiprecision/cpp_int.hpp>
                            #include<functional>
                 //    #define int long long
                            #define inf  1000000007
                            #define pa pair<int,int>
                            #define ll long long
                            #define pal pair<double,int>
                            #define ppa pair<pa,int>
                            #define ppap pair<int,pa>
                            #define ssa pair<string,int>
                            #define  mp make_pair
                            #define  pb push_back
                            #define EPS (1e-10)
                            #define equals(a,b) (fabs((a)-(b))<EPS)
                     
                            using namespace std;
                     //priority_queue<int, vector<int>, greater<int> > que;
                            class Point{
                            	public:
                            	double x,y;
                            	Point(double x=0,double y=0):x(x),y(y) {}
                            	Point operator + (Point p) {return Point(x+p.x,y+p.y);}
                            	Point operator - (Point p) {return Point(x-p.x,y-p.y);}
                            	Point operator * (double a) {return Point(x*a,y*a);}
                            	Point operator / (double a) {return Point(x/a,y/a);}
                            	double absv() {return sqrt(norm());}
                            	double norm() {return x*x+y*y;}
                            	bool operator < (const Point &p) const{
                            		return x != p.x ? x<p.x: y<p.y;
                            	}
                            	bool operator == (const Point &p) const{
                            		return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
                            	}
                            };
                            typedef Point Vector;
                     
                            struct Segment{
                            Point p1,p2;
                            };
                     
                        double hen(Vector a){
                        if(fabs(a.x)<EPS && a.y>0) return acos(0);
                        else if(fabs(a.x)<EPS && a.y<0) return 3*acos(0);
                        else if(fabs(a.y)<EPS && a.x<0) return 2*acos(0);
                        else if(fabs(a.y)<EPS && a.x>0) return 0.0;
                        else if(a.y>0) return acos(a.x/a.absv());
                        else return 2*acos(0)+acos(-a.x/a.absv());
                     
                        }
                     
                string itos( int i ) {
                ostringstream s ;
                s << i ;
                return s.str() ;
                }
                 
                int gcd(int v,int b){
                	if(v>b) return gcd(b,v);
                	if(v==b) return b;
                	if(b%v==0) return v;
                	return gcd(v,b%v);
                }
                            double dot(Vector a,Vector b){
                            	return a.x*b.x+a.y*b.y;
                            }
                            double cross(Vector a,Vector b){
                            	return a.x*b.y-a.y*b.x;
                            }
                        
                double distans(double x1,double y1,double x2,double y2){
                	double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
                	return sqrt(rr);
                	
                }
                /*}
int pr[100010];
//int inv[100010];
 
int beki(int wa,int rr){
	if(rr==0) return 1ll;
	if(rr==1) return wa;
	if(rr%2==1) return (beki(wa,rr-1)*wa)%inf;
	int zx=beki(wa,rr/2);
	return (zx*zx)%inf;
}
  
void gya(){
	pr[0]=1;
	for(int i=1;i<100010;i++){
		pr[i]=(pr[i-1]*i)%inf;
	}
	for(int i=0;i<100010;i++) inv[i]=beki(pr[i],inf-2);
	
}

*/

                         //----------------kokomade tenpure------------
int n;
int dp[101][540005];
//bool me[101][540005]={0};
signed main(){
	int u=10000000;
	while(1){
	cin>>n;
		if(n==0) break;
		int zx=-9000000;
		for(int i=0;i<=100;i++)for(int j=0;j<540005;j++){
			dp[i][j]=zx;
			
			
		}
		
		dp[0][0]=0;
		
		for(int i=1;i<=n;i++){
			int p,pq;
			cin>>p;
			pq=p;
			p%=1000;
			
			if(p==0) p+=1000;
			for(int j=0;j<540005;j++){
				if(dp[i-1][j]==zx) continue;
			
				if(dp[i][j]<dp[i-1][j]) dp[i][j]=dp[i-1][j];
				if(p>500){
	//				me[i][j+(1000-p)]=1;
					if(dp[i][j+(1000-p)]<dp[i-1][j]-pq) dp[i][j+(1000-p)]=dp[i-1][j]-pq;
				}
				else{
	//				me[i][j+(1000-p-500)]=1;
					if(dp[i][j+(500-p)]<dp[i-1][j]+u-pq) dp[i][j+(500-p)]=dp[i-1][j]+u-pq;
				}
				
				if(p>500){
					if(j>=p+500-1000){
	//					me[i][j-(p-500)]=1;
						if(dp[i][j-(p-500)]<dp[i-1][j]+u-pq) dp[i][j-(p-500)]=dp[i-1][j]+u-pq;
					}
				}
				else{
					if(j>=p+500){
	//					me[i][j-(p+500)]=1;
						if(dp[i][j-(p+500)]<dp[i-1][j]+u-pq) dp[i][j-(p+500)]=dp[i-1][j]+u-pq;
					}					
				}
			}
		}
		int ans=zx;
		for(int j=0;j<540005;j++){
			if(dp[n][j]==zx) continue;
			if(dp[n][j]>ans)ans=dp[n][j];
		}
	
		if(ans%u!=0){
		cout<<ans/u +1<<" "<<u-ans%u<<endl;
		}
		else{
			cout<<ans/u<<" 0"<<endl;
		}
	}
	return 0;
}

Measured memory_bytes: 216120