#include <cstdio>
#include <cstdlib>
#include <queue>
#include <string>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAXN=40000;
const int MLEN=32767;
const int INF=(~0u>>2)-4;
int F[MAXN],L[5],Yuan,Need,Ruru;
queue<int> q;

inline void bfs()
{
	q.push(Yuan);
	int tmp,nxt;
	while(q.size())
	{
		tmp=q.front(); q.pop();
		for(int i=1;i<=3;i++)
		{
			nxt=tmp+L[i]; if(nxt>MLEN) continue;
			if(F[nxt]!=INF) continue;
			F[nxt]=F[tmp]+1; q.push(nxt);
			if(nxt==Need) {printf("%d\n",F[nxt]);exit(0);}
		}
		if(tmp>Ruru)
		{
			nxt=Ruru;
			if(F[nxt]==INF)
			{
				F[nxt]=F[tmp]+1;q.push(nxt);
				if(nxt==Need){printf("%d\n",F[nxt]);exit(0);}
			}
			nxt=tmp-Ruru;
			if(F[nxt]==INF)
			{
				F[nxt]=F[tmp]+1;q.push(nxt);
				if(nxt==Need){printf("%d\n",F[nxt]);exit(0);}
			}
		}
		if(tmp>=2)
		{
			nxt=tmp/2;
			if(F[nxt]==INF)
			{
				F[nxt]=F[tmp]+1;q.push(nxt);
				if(nxt==Need){printf("%d\n",F[nxt]);exit(0);}
			}
		}
	}
	printf("No solution.\n");
}

int main()
{
	freopen("wood.in","r",stdin);
	freopen("wood.out","w",stdout);
	scanf("%d %d\n",&Yuan,&Need);
	for(int i=1;i<=3;i++) scanf("%d\n",&L[i]);
	scanf("%d\n",&Ruru);
	if(Yuan==Need) {printf("0\n");return 0;}
	for(int i=1;i<=MLEN;i++) F[i]=INF;
	F[Yuan]=0; bfs();
	return 0;
}