#include <bits/stdc++.h>
using namespace std;
int n, a, b, c;
int ara[8];
int solve() {
  int tmp = n;
  c = 1;
  tmp -= ara[0];
  if (tmp >= ara[1]) {
    tmp -= ara[1];
  } else {
    tmp = n;
    c++;
    tmp -= ara[1];
  }
  if (tmp >= ara[2]) {
    tmp -= ara[2];
  } else {
    c++;
    tmp = n;
    tmp -= ara[2];
  }
  if (tmp >= ara[3]) {
    tmp -= ara[3];
  } else {
    tmp = n;
    c++;
    tmp -= ara[3];
  }
  if (tmp >= ara[4]) {
    tmp -= ara[4];
  } else {
    c++;
    tmp = n;
    tmp -= ara[4];
  }
  if (tmp >= ara[5]) {
    tmp -= ara[5];
  } else {
    c++;
    tmp = n;
    tmp -= ara[5];
  }
  return c;
}
int main() {
  while (cin >> n >> a >> b) {
    ara[0] = ara[1] = ara[2] = ara[3] = a;
    ara[4] = ara[5] = b;
    sort(ara, ara + 6);
    int mn = INT_MAX;
    do {
      mn = min(mn, solve());
    } while (next_permutation(ara, ara + 6));
    cout << mn << endl;
  }
  return 0;
}
