#include<bits/stdc++.h>
#define rep(i,a,b)    for(int i=a;i<b;i++)
#define ret(x) return cout<<x,0;
#define rety return cout<<"YES",0;
#define retn return cout<<"NO",0;
typedef long long ll;
typedef double db;
typedef long double ld;
#define stt string
#define ve vector<ll>
#define se set<ll>
#define ar array
ll mod=1e9+7;
ll mm=998244353;
using namespace std;
ll fac[10000000];
ll gcd(ll x, ll y)
{
   if(y==0)
       return x;
   return gcd(y,x%y);
}
ll fexp(ll a,ll b,ll m){ll ans = 1;while(b){if(b&1)ans=ans*a%m; b/=2;a=a*a%m;}return ans;}
ll inverse(ll a, ll p){return fexp(a, p-2,p);}
ll ncr(ll n, ll r,ll p)
{
   if (r==0) return 1;
   return (fac[n]*inverse(fac[n-r],p)%p*inverse(fac[r],p)%p)%p;
}
// ____Z-Algorithm_____
vector<ll> za(string s)
{
  ll n = s.size();
   vector<ll> z(n);
   ll x = 0, y = 0,p=0;
          for(ll i= 1; i < n; i++)
         {
          z[i] = max(p,min(z[i-x],y-i+1));
        while(i+z[i] < n && s[z[i]] == s[i+z[i]])
             {
              x = i; y = i+z[i]; z[i]++;
             }
         }
return z;
}
int subset(ll a[],ll k)
{
   for (int i = 1; i < pow(2, k); i++)
   {
       for (int j = 0; j < k; j++)
       {
           if (i & 1 << j)
           {
              cout<<a[j]<<" ";
           }
       }
       cout<<endl;
   }
   return 1;
}
vector<ll> pr(string s)
{
   ll n = s.length();
   vector<ll> pi(n);
   for (int i = 1; i < n; i++)
   {
       int j = pi[i-1];
       while (j > 0 && s[i] != s[j])
           j = pi[j-1];
       if (s[i] == s[j])
           j++;
       pi[i] = j;
   }
   return pi;
}
//---------------------------------------------------------------------/
int main()
{
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
   ll a,b,c;
   cin>>a>>b>>c;
   if(2*a==b+c || 2*c==b+a || 2*b==a+c)
          cout<<"Yes";
    else
      cout<<"No";
}

#include <bits/stdc++.h>
using namespace std;


using ll = long long;


void solve(long long R, long long X, long long Y){
    ll dist = (X * X + Y * Y) / (R * R);;
    if(R * R > X * X + Y * Y){
        cout<<2<<endl;
        return;
    }
    if((X * X + Y * Y) % (R * R)){
        dist++;
    }
    ll ok = 0;
    ll ng = 1e9;
    while(ng - ok > 1){
        ll mid = (ok + ng) / 2;

        if(mid * mid <= dist){
            ok = mid;
        }else{
            ng = mid;
        }
    }
    if(ok * ok != dist){
        ok++;
    }
    //cout<<dist<<endl;
    cout<<ok<<endl;
}

int main(){
    long long R;
    scanf("%lld",&R);
    long long X;
    scanf("%lld",&X);
    long long Y;
    scanf("%lld",&Y);
    solve(R, X, Y);
    return 0;
}
