#include <iostream>
#include <string>
#include <queue>
using namespace std;

#define SIZE 101




int main()
{
  int a, b, c;
  cin >> a >> b >> c;
  double dp[SIZE][SIZE][SIZE] = { 0 };

  dp[a][b][c] = 1;

  for (int i = a; i < SIZE; i++) {
    for (int j = b; j < SIZE; j++) {
      for (int k = c; k < SIZE; k++) {
        if (i + j + k <= 1)continue;
        if (i > 0 && j != SIZE - 1 && k != SIZE - 1) {
          dp[i][j][k] += dp[i - 1][j][k] * (i - 1) / (i + j + k - 1);
        }
        if (j > 0 && i != SIZE - 1 && k != SIZE - 1) {
          dp[i][j][k] += dp[i][j - 1][k] * (j - 1) / (i + j + k - 1);
        }
        if (k > 0 && j != SIZE - 1 && i != SIZE - 1) {
          dp[i][j][k] += dp[i][j][k - 1] * (k - 1) / (i + j + k - 1);
        }
      }
    }
  }


  double ans = 0;
  int first = a + b + c;
  for (int i = a; i < SIZE; i++) {
    for (int j = b; j < SIZE; j++) {
      for (int k = c; k < SIZE; k++) {
        if (i == SIZE - 1 || j == SIZE - 1 || k == SIZE - 1) {
          ans += dp[i][j][k] * (i + j + k - first);
        }
      }
    }
  }


  printf("%.8f", ans);
}
#include <iostream>
#include <math.h>
#include <algorithm>

using namespace std;

#define f first
#define s second
#define ll long long
#define mp make_pair
#define ull unsigned long long
#define p push
#define pb push_back

double r, x, y;

int main() {
	cin >> r >> x >> y;
	double dist = sqrt((x * x) + (y * y));
	double ans = dist / r;
	int out = 0;
	if (ceil(ans)!=ans) {
		out = ceil(ans);
	}
	else {
		out = (int)ans;
	}
	if (r > dist) {
		cout << "2\n";
	}
	else {
		cout << out << "\n";
	}
	
}