#include<bits/stdc++.h>
using namespace std;
 
#define debug(x) cerr << #x << ": " << (x) << endl
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define dwn(i,a,b) for(int i=(a);i>=(b);i--)
#define pb push_back
#define all(x) (x).begin(), (x).end()
 
#define x first
#define y second
using pii = pair<int, int>;
using ll = long long;
 
inline void read(int &x){
    int s=0; x=1;
    char ch=getchar();
    while(ch<'0' || ch>'9') {if(ch=='-')x=-1;ch=getchar();}
    while(ch>='0' && ch<='9') s=(s<<3)+(s<<1)+ch-'0',ch=getchar();
    x*=s;
}

int exgcd(int a, int b, int &x, int &y){
	if(!b) return x=1, y=0, a;
	int d=exgcd(b, a%b, y, x);
	y-=a/b*x;
	return d;
}

int floor(int a, int b){
	if(a%b==0) return a/b;
	return ((a<0) xor (b<0)? a/b-1: a/b);
}

int ceil(int a, int b){
	return (a+b-1)/b;
}

void print(int x, int y){
	string fir="truck";
	string sec="boat";
	if(x>1) fir+="s";
	if(y>1) sec+="s";
	// We need 3 trucks and 5 boats.
	cout<<"We need "<<x<<" "<<fir<<" and "<<y<<" "<<sec<<".";
}

signed main(){
	int a, b, c, d;
	cin>>a>>b>>c>>d;
	
	int X=1e9, Y;
	rep(y, ceil(c, b), 1000000){
		int t=b*y+d;
		if(t%a==0){
			int x=t/a;
			if(X>x) X=x, Y=y;
		}
	}
	if(X>1e8){
		puts("No solution.");
		return 0;
	}
	print(X, Y);
	
	return 0;
}