#include<bits/stdc++.h>
#define w(x)            int x; cin>>x; for(int tc=1;tc<=x;tc++)
#define trace(x) 		cerr<<#x<<": "<<x<<" "<<endl;
#define trace1(x,y)		cerr<<#x<<": "<<x<<" "<<endl;cerr<<#y<<": "<<y<<" "<<endl;
#define FIO             ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define pb push_back
#define endl "\n"
#define mod 1000000007
#define inp(x) cin>>x;
#define f first
#define s second
#define inf 1e18

using namespace std;
void solve(int tc) {
	long double r;
	cin >> r;
	long double x, y;
	cin >> x >> y;
	long double dis = sqrt(x * x + y * y);
	dis /= r;
	if (dis < 1) {
		cout << 2 << endl;
		return;
	}
	cout << ceil(dis) << endl;

}

int32_t main() {
	FIO
#ifndef ONLINE_JUDGE
	freopen("in.txt", "r", stdin);
	freopen("out.txt", "w", stdout);
#endif
	// w(x) {
	solve(1);
	// }
	return 0;
}
#include<bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n;
    vector<int> a(n);
    for(int i = 0; i < n; i++) cin >> a[i];
    vector<vector<int>> m(n, vector<int>(n, -1));
    for(int i = 0; i < n; i++) {
        int mi = 1e9;
        mi = min(mi, a[i]);
        for(int j = i; j < n; j++) {
            mi = min(mi, a[j]);
            m[i][j] = mi;
        }
    }
    int M = 0;
    for(int i = 0; i < n; i++) for(int j = i; j < n; j++) {
        M = max(M, m[i][j] * (abs(j - i)+1));
    }
    cout << M << endl;
}