#include <bits/stdc++.h>
using namespace std;
const int MX = 6;
int n, Arr[6];
int solve(int rem, int mask) {
  if (mask == ((1 << MX) - 1)) return 0;
  int Ans = 50;
  for (int i = 0; i < MX; i++) {
    if (!(mask & (1 << i))) {
      if (rem < Arr[i])
        Ans = min(Ans, 1 + solve(n - Arr[i], mask | (1 << i)));
      else
        Ans = min(Ans, solve(rem - Arr[i], mask | (1 << i)));
    }
  }
  return Ans;
}
int main() {
  scanf("%d %d %d", &n, &Arr[0], &Arr[2]);
  Arr[1] = Arr[3] = Arr[4] = Arr[0];
  Arr[5] = Arr[2];
  printf("%d\n", solve(0, 0));
  return 0;
}
