#include<bits/stdc++.h>
using namespace std;
typedef long long int LL;
const LL N=1,M=1,MOD=1;int main()
{//freopen("t.txt","r",stdin);int c,v0,v1,a,l;scanf("%d%d%d%d%d",&c,&v0,&v1,&a,&l);int nv=0,nr=v0;int ans=0;while(nv<c){nv+=v0;ans++;if(nv>=c){printf("%d\n",ans);return 0;}v0+=a;v0=min(v0,v1);nv-=l;nv=max(0,nv);  }return 0;
}

#include <iostream>int main(){int N,A;std::cin>>N>>A;std::cout<<"2 1 "<<std::max(3,std::min(N,(N*A+90)/180+2))<<std::endl;return 0;
}

#include <stdio.h>
#include <algorithm>
using namespace std;int a, b, st, en;int tag(int k) {int rlt = (k - 1) / (a + b);if ((k - 1) % (a + b) < a) return rlt * 2 + 1;return rlt * 2 + 2;
}int solve(int st, int en) {int u = tag(st), v = tag(en);if (v > u + 4) return max(a + 1, 2 * a - b);if (v == u) return u & 1 ? en - st + 1 : 1;if (v == u + 1) return u & 1 ? a - ((st - 1) % (a + b)) : ((en - 1) % (a + b)) + 2;if (v == u + 2) {int x = a - ((st - 1) % (a + b)), y = (en - 1) % (a + b) + 1;return u & 1 ? max(min(x + y, a), max(x, y + min(x, a - b))) : a + 1;}return max(solve(a * (tag(st) & 1) + 1 + (a + b) * (tag(st) >> 1), en), solve(st, (a + b) * ((tag(en) - 1) >> 1) + a * ((tag(en) - 1) & 1)));
}int main() {scanf("%d %d %d %d", &a, &b, &st, &en);printf("%d\n", solve(st, en));return 0;
}

#include <bits/stdc++.h>using namespace std;int n, ta, tb, md;
long long mi = LLONG_MAX, cur, cs, dx[2000005], add[2000005];int main() {scanf("%d", &n);for (int i = 1; i <= n; i++) {scanf("%d", &ta);cur += abs(ta - i);dx[(ta - i + n) % n] += 2;dx[(1 - i + n) % n] -= 2;add[n-i] += abs(ta - 1) - (abs(ta - n) + 1);if ((1 - i + n) % n <= (ta - i + n) % n)cs++;elsecs--;}for (int i = 0; i < n; i++) {if (cur < mi)mi = cur, md = i;cs += dx[i];cur += cs + add[i];}printf("%lld %d\n", mi, md);return 0;
}