//杭电1049 Climbing Worm
#include <iostream>
#include<stdio.h>
#include<algorithm>
#include<iomanip>
using namespace std;

int main()
{
    int n,u,d;
    int t,i;
    while(scanf("%d %d %d",&n,&u,&d)!=EOF&&n!=0)
    {
        if(n<=u)//高度小于每分钟爬的高度时，只需1分钟//<=很重要，有一个错误，最终发现在这
        {
            t=1;
        }
        else
        {
            for(i=1; ;i++)
            {
                if(n<=(u-d)*i+u)
                    break;
            }
            t=i*2+1;
        }
         printf("%d\n",t);
    }
    return 0;
}

//杭电1049 Climbing Worm
#include <iostream>
#include<stdio.h>
#include<algorithm>
#include<iomanip>
using namespace std;

int main()
{
    int n,u,d;
    int t,s;
    while(scanf("%d %d %d",&n,&u,&d)!=EOF&&n!=0)
    {
        t=0;s=0;
        while(1)
        {
            s+=u;
            t++;
            if(s>=n)
            break;
            s-=d;
            t++;
        }
        printf("%d\n",t);
    }
    return 0;
}