#include <bits/stdc++.h>
using namespace std;
int n, a, b;
const int INF = 1 << 30;
int solve(const int rem1, const int rem2, const int len, const int dist) {
  if (!rem1 && !rem2) return dist;
  int best = INF;
  if (rem1 && len >= a) best = min(best, solve(rem1 - 1, rem2, len - a, dist));
  if (rem2 && len >= b) best = min(best, solve(rem1, rem2 - 1, len - b, dist));
  if ((!rem1 || a > len) && (!rem2 || b > len))
    best = min(best, solve(rem1, rem2, n, dist + 1));
  return best;
}
int main() {
  scanf("%d %d %d", &n, &a, &b);
  printf("%d\n", solve(4, 2, n, 1));
}
