#include <bits/stdc++.h>

using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()

template<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }

template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type
fill_v(T &t, const V &v) { t=v; }
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }

template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a) {
    out<<'('<<a.first<<','<<a.second<<')'; return out;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
    out<<'[';
    for(const T &i: a) out<<i<<',';
    out<<']';
    return out;
}
template<class T>
ostream &operator <<(ostream& out, const set<T>& a) {
    out<<'{';
    for(const T &i: a) out<<i<<',';
    out<<'}';
    return out;
}
template<class T, class S>
ostream &operator <<(ostream& out, const map<T,S>& a) {
    out<<'{';
    for(auto &i: a) out<<i<<',';
    out<<'}';
    return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1<<30;
const ll LLINF = 1LL<<60;
const ll MOD = 1000000007;

PII f(PII a, PII b) {
    if(a.first>b.first || (a.first==b.first && a.second<b.second)) return a;
    return b;
}

signed main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    while(1) {
        ll n;
        cin >> n;
        if(!n) break;
        vector<ll> p(n);
        REP(i, n) cin >> p[i];

        ll cur = 0, nxt = 1;
        vector<vector<PII>> dp(2, vector<PII>(50000, {-LLINF, LLINF}));
        dp[0][0] = {0, 0};
        REP(i, n) {
            dp[nxt] = vector<PII>(50000, {-LLINF, LLINF});
            REP(j, 50000) {
                if(dp[cur][j].first == LLINF) continue;
                // 小銭を出すことで500円玉をもらう
                ll use = (p[i]+500)%1000;
                if(use <= j) {
                    PII now(dp[cur][j]);
                    now.first++;
                    now.second += p[i];
                    dp[nxt][j-use] = f(dp[nxt][j-use], now);
                }
                // 何もしない
                dp[nxt][j] = f(dp[nxt][j], dp[cur][j]);
                // 1000円だけ出す
                PII now(dp[cur][j]);
                ll get = 1000-p[i]%1000;
                if(get == 1000) get = 0;
                if(get >= 500) {
                    now.first++;
                    get -= 500;
                }
                now.second += p[i];
                if(j+get < 50000) dp[nxt][j+get] = f(dp[nxt][j+get], now);
            }
            swap(cur, nxt);
        }

        // REP(i, 10) cout << dp[cur][i] << " ";
        // cout << endl;

        PII ret(0, 0);
        REP(i, 50000) ret = f(ret, dp[cur][i]);
        cout << ret.first << " " << ret.second << endl;
    }

    return 0;
}



Measured memory_bytes: 5200