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

int n, pn, a1, a2, cnt=2, to[10005];
struct L{int l, r, pre, nxt;}u[10005];
struct P{int m, t, mr;}p[10005];
struct N{int num, t, opt; bool operator<(const N& b)const{return t==b.t?opt<b.opt:t>b.t;}};

queue<int> w;
priority_queue<N> q;

int f(int mr) {
    int now=1;
    while(u[now].nxt!=-1) {
        if(u[u[now].nxt].l - u[now].r -1 >= mr) return now;
        now=u[now].nxt;
    }
    return -1;
}

void ins(int num) {
    int pos=f(p[num].mr);
    if(pos==-1) {w.push(num); a2++;}
    else {
        int st=u[pos].r+1;
        cnt++;
        u[cnt]={st, st+p[num].mr-1, pos, u[pos].nxt};
        u[u[pos].nxt].pre=cnt;
        u[pos].nxt=cnt;
        to[num]=cnt;
        q.push({num, p[num].m + p[num].t, 2});
    }
}

void del(int num) {
    int d=to[num];
    u[u[d].pre].nxt=u[d].nxt;
    u[u[d].nxt].pre=u[d].pre;
}

void wi(int t) {
    while(!w.empty()) {
        int x=w.front(), pos=f(p[x].mr);
        if(pos!=-1) {
            int st=u[pos].r+1;
            cnt++;
            u[cnt]={st, st+p[x].mr-1, pos, u[pos].nxt};
            u[pos].nxt=u[u[cnt].nxt].pre=cnt;
            to[x]=cnt;
            q.push({x, t+p[x].t, 2});
            w.pop();
        } else break;
    }
}

int main() {
	freopen("memory.in","r",stdin);
	freopen("memory.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin>>n;
    u[1]={-1,-1,-1,2};
    u[2]={n,n,1,-1};
    pn=1;
    while(cin>>p[pn].m>>p[pn].mr>>p[pn].t && p[pn].mr) {
        q.push({pn, p[pn].m, 1});
        pn++;
    }
    while(!q.empty()) {
        st:
        N x=q.top(); q.pop();
        a1=max(a1, x.t);
        if(x.opt==1) ins(x.num);
        else del(x.num);
        if(!q.empty() && q.top().t==x.t && q.top().opt==2) goto st;
        wi(x.t);
    }
    cout<<a1<<'\n'<<a2;
}