#include <bits/stdc++.h>
using namespace std;
using LL = long long;

#define fs first
#define sc second

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }


// std::vector Declaration
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...));
}

// std::vector Initialization
template<typename T>
void fill_all(T& arr, const T& v) { arr = v; }
template<typename T, typename U>
void fill_all(T& arr, const U& v) { for (auto& i : arr) fill_all(i, v); }

// std::vector Debug
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v ) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::pair Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << " " << p.second << ")";
    return os;
}

// std::set Debug
template<typename T>
ostream& operator<<(ostream& os, const set<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::multiset Debug
template<typename T>
ostream& operator<<(ostream& os, const multiset<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::map Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const map<T, U>& mp) {
    os << "{";
    bool a = 1;
    for (auto e : mp) {
        os << (a ? "" : " ");
        os << e.first << ":" << e.second;
        a = 0;
    }
    os << "}";
    return os;
}

// std::tuple Debug
template<int N, class Tuple>
void out(ostream& os, const Tuple& t){}
template<int N, class Tuple, class H, class ...Ts>
void out(ostream& os, const Tuple& t) {
    if (N) os << " ";
    os << get<N>(t);
    out<N+1,Tuple,Ts...>(os, t);
}
template<class ...Ts>
ostream& operator<<(ostream& os, const tuple<Ts...>& t) {
    os << "(";
    out<0,tuple<Ts...>,Ts...>(os, t);
    os << ")";
    return os;
}

// Debug
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl


struct edge { int to, cost; };
ostream& operator<<(ostream& os, const edge& e) {
    os << "(" << e.to << ", " << e.cost << ")";
    return os;
}

const LL LINF = 1LL<<60;
const int IINF = 1<<30;
const LL MOD = 1e9+7;

struct Pair {
    int k, cost;
};
bool operator<(const Pair& lhs, const Pair& rhs) {
    if (lhs.k == rhs.k) return lhs.cost < rhs.cost;
    return lhs.k > rhs.k;
}
ostream& operator<<(ostream& os, const Pair& p) {
    os << "(" << p.k << ", " << p.cost << ")";
    return os;
}

int main()
{
    vector<int> ns;
    vector<vector<int>> ps;

    while (true) {
        int n; cin >> n;
        if (n == 0) {
            break;
        }
        vector<int> p(n);
        for (int i = 0; i < n; ++i) {
            cin >> p[i];
        }
        ns.push_back(n);
        ps.push_back(p);
    }

    for (int t = 0; t < ns.size(); ++t) {
        int n = ns[t];
        auto p = ps[t];

        vector<int> q(n);
        for (int i = 0; i < n; ++i) {
            q[i] = ((-p[i] % 1000) + 1000) % 1000;
        }

        int sumq = accumulate(q.begin(), q.end(), 0);

        auto dp = make_v<Pair>(2, sumq+1);
        // dp[i%2][s] := (k, c)
        //                 [0,i) までで500円がk枚, 手持ちがs 円のときの
        //                 支払額がc. kが大きいほど, cが小さいほど良い
        fill_all(dp, Pair{-IINF,IINF});
        dp[0][0] = Pair{0, 0};

        for (int i = 0; i < n; ++i) {
            for (int s = 0; s <= sumq; ++s) {
                // 買わないとき
                chmin(dp[(i+1)&1][s], dp[i&1][s]);

                // 買うとき
                // 500円を生み出せるとき
                if (s+q[i] >= 500) {
                    if (s+q[i]-500 <= sumq) {
                        auto tmp = dp[i&1][s];
                        tmp.k += 1;
                        tmp.cost += p[i];
                        chmin(dp[(i+1)&1][s+q[i]-500], tmp);
                    }
                }
                if (s+q[i] <= sumq) {
                    auto tmp = dp[i&1][s];
                    tmp.cost += p[i];
                    chmin(dp[(i+1)&1][s+q[i]], tmp);
                }
            }
        }

        Pair Min{-IINF, IINF};
        for (int s = 0; s <= sumq; ++s) {
            chmin(Min, dp[n%2][s]);
        }
        cout << Min.k << " " << Min.cost << endl;
    }

    return 0;
}



Measured memory_bytes: 5236