#include <fstream>
using namespace std;

short int v[1<<10];
int d,n,x,y,z;

ifstream in("koba.in");
ofstream out("koba.out");

inline int set(int a)
{
	return (a/100+a/10%10*(a%10))%10*100+a/10;
}

void search()
{
	int i,j;
	v[1]=x%10*100+y%10*10+z%10;
	for (i=2;i<1000;i++)
	{
		v[i]=set(v[i-1]);
		for (j=1;j<i;j++)
			if (v[i]==v[j])
			{
				x=j;
				y=i-1;
				z=i-j;
				return;
			}
	}
}

int main()
{
	int i,s=0,q;
	in>>n>>z>>y>>x;
	s=z+y*(n>1);n-=2;
	search();
	if (n>y)
	{
		q=(n-x)/z;
		n-=q*z;
		for (i=x;i<=y;i++)
			s+=q*(v[i]/100);
	}
	for (i=1;i<=n;i++)
		s+=v[i]/100;
	out<<s<<"\n";
	return 0;
}