#include<stdio.h>
#include<algorithm>
using namespace std;
int a[101];
int max(int a, int b) {
if (a > b)return a; return b;
}
int main() {
int n;
int i, j;
int S = 0;
int ans = 0, ans2 = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
sort(a, a + n);
for (i = 0; i < n; i++) {
S += a[i];
if (S > 710)
break;
ans++;
ans2 += max(0, S - 350);
}
printf("%d %d", ans, ans2);
return 0;
}
I2luY2x1ZGU8c3RkaW8uaD4KI2luY2x1ZGU8YWxnb3JpdGhtPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBhWzEwMV07CmludCBtYXgoaW50IGEsIGludCBiKSB7CglpZiAoYSA+IGIpcmV0dXJuIGE7IHJldHVybiBiOwp9CiAKaW50IG1haW4oKSB7CglpbnQgbjsKCWludCBpLCBqOwoJaW50IFMgPSAwOwoJaW50IGFucyA9IDAsIGFuczIgPSAwOwoKCXNjYW5mKCIlZCIsICZuKTsKCglmb3IgKGkgPSAwOyBpIDwgbjsgaSsrKSB7CgkJc2NhbmYoIiVkIiwgJmFbaV0pOwoJfQoJc29ydChhLCBhICsgbik7CgoJZm9yIChpID0gMDsgaSA8IG47IGkrKykgewoJCVMgKz0gYVtpXTsKCQlpZiAoUyA+IDcxMCkKCQkJYnJlYWs7CgkJYW5zKys7CgkJYW5zMiArPSBtYXgoMCwgUyAtIDM1MCk7Cgl9CglwcmludGYoIiVkICVkIiwgYW5zLCBhbnMyKTsKCglyZXR1cm4gMDsKfQ==