#include <bits/stdc++.h>
using namespace std;
map<int, int> mp;
int fin(int rem) {
  for (auto p : mp) {
    if (p.first >= rem) return p.first;
  }
  return -1;
}
int main() {
  long long ans = 0, rem = 0, p, x, y, n, RES = 1e9;
  cin >> n >> x >> y;
  long long a[] = {x, x, x, x, y, y};
  sort(a, a + 6);
  do {
    mp.clear();
    ans = 0;
    for (int i = 0; i < 6; ++i) {
      if ((x = fin(a[i])) == -1) {
        ++ans;
        ++mp[n - a[i]];
      } else {
        ++mp[x - a[i]];
        if (!--mp[x]) mp.erase(x);
      }
    }
    RES = min(RES, ans);
  } while (next_permutation(a, a + 6));
  cout << RES;
}
