#include<bits/stdc++.h>
using namespace std;
int n,w=INT_MAX,cnt=0;
struct node{
    int t,m,p,s;
    friend bool operator<(const node aa,const node bb){
        return bb.s<aa.s;
    }
}qwq; 
vector<node> v;
queue<node> q;
bool solve(int t){
    if(v.empty()||v[0].s>=qwq.m){
        qwq.s=0;
        qwq.t=t;
        v.push_back(qwq);
        sort(v.begin(),v.end());
        return 1;
    }
    for(int i=1;i<v.size();i++)
        if(v[i].s-(v[i-1].s+v[i-1].m)>=qwq.m){
            qwq.s=v[i-1].s+v[i-1].m;
            qwq.t=t;
            v.push_back(qwq);
            sort(v.begin(),v.end());
            return 1;
        }
    int sz=v.size();
    if(n-(v[sz-1].s+v[sz-1].m)>=qwq.m){
        qwq.s=v[sz-1].s+v[sz-1].m;
        qwq.t=t;
        v.push_back(qwq);
        sort(v.begin(),v.end());
        return 1;
    }
    return 0;
}
void anss(){
    int nw=INT_MAX;
    for (int i=0;i<v.size();i++)
        if (v[i].t+v[i].p==w) v.erase(v.begin()+i--);
        else nw=min(nw,v[i].t+v[i].p);
    while(q.size()){
        qwq=q.front();
        if(solve(w)){
            nw=min(nw,q.front().t+q.front().p);
            q.pop();
            cnt++;
        }else break;
    }
    w=nw;
}
void work(int t, int m, int v) {
    while(t>=w) anss();
    qwq.t=t;
    qwq.m=m;
    qwq.p=v;
    if (solve(t)) w=min(w,t+v);
    else q.push(qwq);
}
int main(){
    freopen("memory.in","r",stdin);
	freopen("memory.out","w",stdout);
    cin>>n;
    int x,y,z;
    while(1){
        cin>>x>>y>>z;
        if(x==0&&y==0&&z==0) break;
        work(x,y,z);
    }
    while(q.size())
        anss();
    int ans=w;
    for(int i=0;i<v.size();i++)
        ans=max(ans,v[i].t+v[i].p);
    cout<<ans<<'\n'<<cnt<<'\n';
    return 0;
}