#include using namespace std; #define rep(i,a,b) for(ll i=a;i=b;i--) #define ll long long #define ull unsigned ll #define ld long double #define bl __int128_t #define fi first #define se second #define vel vector #define vvel vector #define pll pair #define vepll vector #define vvepll vector #define ves vector #define vem vector #define vvem vector #define pmm pair #define bl __int128_t #define cleout(i) cout<using PQ=priority_queue,greater>; // 上 右 下 左 vector di={-1, 0, 1, 0}; vector dj={ 0, 1, 0,-1}; vector dx={ 0, 1, 0,-1}; vector dy={ 1, 0,-1, 0}; vector ddx={ 1, 1, 1, 0, -1, -1, -1, 0 }; vector ddy={ 1, 0, -1, -1, -1, 0, 1, 1 }; ll inf=1000000000000000000;//1e18 // LLONG_MAX mt19937_64 rng((ull)chrono::steady_clock::now().time_since_epoch().count()); //[x^M]1/(1-x)^N=comb(N-1+M,M) void _solve(){ ll N,X,Y,A,B; cin>>N>>X>>Y>>A>>B; if(N<=10){ rep(i,0,N){ if(X+Y<0)X+=A; else Y-=B; } }else if(A>0&&B>0){ if(X+Y<0){ if(X+Y+A*N1){ ll mid=(ok+ng)/2; if(X+Y+A*mid-B*(N-mid)=-B){ cout<1){ ll mid=(ok+ng)/2; if(X+Y+A*(N-mid)-B*mid>=-B)ok=mid; else ng=mid; } cout<>_; else _=1; rep(__,0,_){ _solve(); } }