#include<iostream>
#include<algorithm>

#define lint int64_t

#define gcd __gcd

#define inf 998244353

using
		namespace
					std;

lint a,b,c,d;
lint x,y;

/*

ax-by=d
by>=c
by<=ax

*/

bool judge(){
	
	//31 13 50 28
	
	if(a*x-d<0) return false;
	
	if((a*x-d)%b) return false;
	
	y=(a*x-d)/b;
	
	if(b*y>a*x) return false;
	
	return b*y>=c;
}

signed main(){
	
	cin>>a>>b>>c>>d;
	
	for(x=0;x<200;x++){
		
		if(judge()){
			
			goto print;
		}
	}
	
	x=y=inf;
	
print:
	
	if(x==inf){
		
		printf("No solution.\n");
	}
	else{
		
		printf("We need %lld truck",x);
		if(x==1) putchar('s');
		printf(" and %lld boat",y);
		if(y==1) putchar('s');
		printf(".\n");
	}
	
end:
	return EOF+1;
}
/*

31 13 50 28
100 20 30 10
1 1 1 100

100 1 99 1
100 1 23 99
*/