Door Frames

Petya has equal wooden bars of length n. He wants to make a frame for two equal doors. Each frame has two vertical (left and right) sides of length a and one top side of length b. A solid (i.e. continuous without breaks) piece of bar is needed for each side.

Determine a minimal number of wooden bars which are needed to make the frames for two doors. Petya can cut the wooden bars into any parts, but each side of each door should be a solid piece of a wooden bar (or a whole wooden bar).

Input

The first line contains a single integer n (1 ≤ n ≤ 1 000) — the length of each wooden bar.

The second line contains a single integer a (1 ≤ a ≤ n) — the length of the vertical (left and right) sides of a door frame.

The third line contains a single integer b (1 ≤ b ≤ n) — the length of the upper side of a door frame.

Output

Print the minimal number of wooden bars with length n which are needed to make the frames for two doors.

Examples

Input

8
1
2

Output

1

Input

5
3
4

Output

6

Input

6
4
2

Output

4

Input

20
5
6

Output

2

Note

In the first example one wooden bar is enough, since the total length of all six sides of the frames for two doors is 8.

In the second example 6 wooden bars is enough, because for each side of the frames the new wooden bar is needed.

#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
	int l,nlen,ngao,len,gao;

int main()
{
    int i,j;
	while(cin>>l)
	{
    cin>>gao>>len;
	int ll;
	ngao=4;
	nlen=2;
	int m=0;
	if(l>(gao*2+len))            //特殊：例如11 5 3的情况  不是（5 5）（3 3 3）（3）而是（5 3 3）（5 3 3 ）
    {
        if(l>=(gao*4+len*2))
            {
                cout<<"1"<<endl;
                return 0;
            }
        else
            {
                cout<<"2"<<endl;
                return 0;
            }
    }
    else
    {
        if(gao>len)
	    {
	       while(ngao||nlen)
                {
                ll=l;
                m++;
             	while(ll>=gao&&ngao>0)
                	   {
                	   	   ll=ll-gao;
                	   	     ngao--;
                	   }
                	while(ll>=len&&nlen>0)
                	    {
                	    ll=ll-len;
                	nlen--;
                }
                }
	   }
	    else {
		while(ngao||nlen)
                {    ll=l;
                m++;
                	while(ll>=len&&nlen>0)
                	    {
                	    ll=ll-len;
                	nlen--;
                }
             	while(ll>=gao&&ngao>0)
                	   {
                	   	   ll=ll-gao;
                	   	ngao--;
                	   }
                }
	    }
	}
	   cout<<m<<endl;
	}
	return 0;
}