#include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;

ll r,x,y;

int main(void){
	scanf("%lld%lld%lld",&r,&x,&y);
	ll gg=r*r;
	ll dist=x*x+y*y;
	if(gg==dist){
		printf("%lld\n",1LL);
	}else if(gg>dist){
		printf("%lld\n",2LL);
	}else{
		ll l=0;
		ll rr=(x+y)/r+10LL;
		while(l+1LL<rr){
			ll mid=(l+rr)/2LL;
			ll ggg=gg*mid*mid;
			if(ggg>=dist){
				rr=mid;
			}else{
				l=mid;
			}
		}
		printf("%lld\n",rr);
	}
	return 0;
}

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;

int main() {
	char c[10];
	int e = 0, n = 0, f = 0, ans = 0;

	for (int i = 0; i < 10; i++) {
		cin >> c[i];
		if (c[i] == 'o') { e++; }
		else if (c[i] == 'x') { n++; }
		else { f++; }
	}

	if (e > 4) { ans = 0; }
	
  	if (e == 4) { ans = 24; }
		
  	if (e == 3) { ans = 24 * f
      					+ 12 * 3; }
	
  	if (e == 2) { ans = 24 * f * (f - 1) / 2 //バラバラ
      					+ 36 * f //1個1個2個
      					+ 6 //2個2個 
      					+ 8 * 1;} // 1個3個
	
  	if (e == 1) { ans = 24 * f * (f - 1) * (f - 2) / 6 //バラバラ
      					+ 36 * f * (f - 1) / 2 //1個1個2個
      					+ 6 * f //2個2個
      					+ 8 * f //1個3個
      					+ 1; } // 4個
	
  	if (e == 0) { ans = f * (f - 1) * (f - 2) * (f - 3) 
      					+ 12 * f * (f - 1) * (f - 2) / 2
      					+ 6 * f * (f - 1) / 2
      					+ 4 * f * (f - 1)
      					+ f;}
	
	printf("%d\n", ans);
}