#include<bits/stdc++.h> 
using namespace std;
const int INF=0x3f3f3f3f;
struct P{
	int t,m,p,s;
}x;
bool cmp(P &a,P &b){
	return a.s<b.s;
}
queue<P> q;
vector<P> v;
int n,t,m,p,cnt,w=INF;
bool inn(int t){
	if(v.empty()||v[0].s>=x.m){
		x.t=t;x.s=0;
		v.push_back(x);
		sort(v.begin(),v.end(),cmp);
		return 1;
	}
	for(int i=1;i<(int)v.size();i++){
		if(v[i].s-(v[i-1].s+v[i-1].m)>=x.m){
			x.t=t;x.s=v[i-1].s+v[i-1].m;
			v.push_back(x);
			sort(v.begin(),v.end(),cmp);
			return 1;
		}
	}
	P i=v.back();
	if(n-i.s+i.m>=x.m){
		x.t=t;x.s=i.s+i.m;
		v.push_back(x);
		sort(v.begin(),v.end(),cmp);
		return 1;
	}
	return 0;
}

void outt(){
	int nt=INF;
	for(int i=0;i<(int)v.size();i++){
		if(v[i].t+v[i].p==w){
			v.erase(v.begin()+i);
			i--;
		}else{
			nt=min(nt,v[i].t+v[i].p);
		}	
	}
	while(!q.empty()){
		x=q.front();
		if(inn(w)){
			nt=min(nt,x.t+x.p);
			q.pop();
			cnt++;
		}else{
			break;
		}
	}
	w=nt;
}
int main(){
	freopen("memory.in","r",stdin);
	freopen("memory.out","w",stdout);
	cin>>n;
	while(cin>>t>>m>>p){
		if(t==0&&m==0&&p==0){
			break;
		}
		while(t>=w){
			outt();
		}
		x.t=t;x.m=m;x.p=p;
		if(inn(t)){
			w=min(w,t+p);
		}else{
			q.push(x);
		}
	}
	while(!q.empty()){
		outt();
	}
	int ans=w;
	for(int i=0;i<(int)v.size();i++){
		ans=max(ans,v[i].t+v[i].p);
	}
	cout<<ans<<endl<<cnt;
	return 0;
}