#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>
#include <cassert>


using namespace std;
#define SZ(x) (int)(x.size())
#define REP(i, n) for(int i=0;i<n;++i)
#define FOR(i, a, b) for(int i=a;i<b;++i)
#define RREP(i, n) for(int i=n-1;i>=0;--i)
#define RFOR(i, a, b) for(int i=b-1;i>=a;--i)

#define all(x) begin(x),end(x)
#define dump(x) cerr<<#x<<" = "<<(x)<<endl
#define debug(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<< endl;

#pragma O3

//using ll = long long;
using ll = int;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<int, int>;
const double eps = 1e-8;
const ll MOD = 1000000007;
const int INF = INT_MAX / 2;
//const ll LINF = LLONG_MAX / 2;

template<class T>
inline bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
inline bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}


template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> p) {
    os << p.first << ":" << p.second;
    return os;
}

template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    os << "[";
    REP(i, SZ(v)) {
        if (i) os << ", ";
        os << v[i];
    }
    return os << "]";
}

// edit

ll dp[2][105][100001];

bool solve() {
//    memset(dp, 0, sizeof(dp));
    

    int N;
    cin >> N;
    
    if(N == 0) return false;
    
    for(int j = 0; j <= N; ++j){
        for(int k = 0; k <= 500 * N; ++k){
            dp[0][j][k] = INF;
            dp[1][j][k] = INF;
        }
    }
    vector<int> p(N);
    for(int i = 0; i < N; ++i){
        cin >> p[i];
    }
    
    dp[0][0][0] = 0;
    
    for(int i = 0; i < N; ++i){
        // reset i + 1
        int ci = i % 2;
        int ni = (i + 1) % 2;
        for(int j = 0; j <= N; ++j){
//            for(int k = 0; k < 100001; ++k){
            for(int k = 0; k <= 500 * i; ++k){
                dp[ni][j][k] = INF;
            }
        }
        
        for(int j = 0; j <= i; ++j){
//            for(int k = 0; k < 100001; ++k){
            for(int k = 0; k <= 500 * i; ++k){
                if(dp[ci][j][k] == INF) continue;
                // お金を使わない場合
                chmin(dp[ni][j][k], dp[ci][j][k]);
                
                // お金を使う場合
                int turi = 1000 - p[i] % 1000;
                if(turi == 1000) turi = 0;
                if(k + turi >= 500){
                    chmin(dp[ni][j + 1][k + turi - 500], dp[ci][j][k] + p[i]);
                }else{
                    chmin(dp[ni][j][k + turi], dp[ci][j][k] + p[i]);
                }
            }
        }
        
    }
    
    ll max_val = 0, min_cost = 0;
    
    for(int x = 0; x <= N; ++x){
//        for(int y = 0; y < 100001; ++y){
        for(int y = 0; y <= 500 * N; ++y){
            if(dp[N % 2][x][y] < INF){
                if(x > max_val){
                    max_val = x;
                    min_cost = dp[N%2][x][y];
                }else if(x == max_val){
                    chmin(min_cost, dp[N%2][x][y]);
                }
            }
        }
    }
    
    cout << max_val << " " << min_cost << endl;

    return true;
    

    

}


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
//    std::ifstream in("input.txt");
//    std::cin.rdbuf(in.rdbuf());

    while( solve());


    return 0;
}



Measured memory_bytes: 43464