#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int case1(int n, int a, int b) {
  if (n < 2 * b) return INF;
  int arr[] = {n - 2 * b, n, n, n, n, n};
  int cnt = 0;
  for (int i = 0; i < 4; i++) {
    if (arr[cnt] >= a) {
      arr[cnt] -= a;
    } else {
      arr[++cnt] -= a;
    }
  }
  return (cnt + 1);
}
int case2(int n, int a, int b) {
  int arr[] = {n - b, n - b, n, n, n, n};
  int cnt = 0;
  for (int i = 0; i < 4; i++) {
    if (arr[cnt] >= a) {
      arr[cnt] -= a;
    } else if (arr[++cnt] >= a) {
      arr[cnt] -= a;
    } else {
      arr[++cnt] -= a;
    }
  }
  return (max(cnt, 1) + 1);
}
int main() {
  int n, a, b;
  cin >> n >> a >> b;
  cout << min(case1(n, a, b), case2(n, a, b));
  return 0;
}
