#include <bits/stdc++.h>
using namespace std;
bool checkbit(int x, int y) { return (x & (1 << y)); }
int setbit(int x, int y) { return (x ^ (1 << y)); }
const int dirs[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
const int mod = (1e9 + 7);
const int INF = (0x7fffffff);
const int maxn = 0;
int n;
vector<int> tr;
int main() {
  for (int i = (0); i < (4); i++) tr.push_back(1);
  for (int i = (0); i < (2); i++) tr.push_back(2);
  int gans = INF;
  scanf("%d", &n);
  int a, b;
  scanf("%d %d", &a, &b);
  for (int j = (0); j < (15); j++) {
    multiset<int> ms;
    for (int i = (0); i < (6); i++) ms.insert(n);
    for (int i = (0); i < (6); i++) {
      if (tr[i] == 2) {
        auto it = ms.lower_bound(b);
        int t = *it;
        t -= b;
        ms.erase(it);
        ms.insert(t);
      } else {
        auto it = ms.lower_bound(a);
        int t = *it;
        t -= a;
        ms.erase(it);
        ms.insert(t);
      }
    }
    int ans = 6;
    for (auto a : ms) {
      if (a == n) {
        ans--;
      }
    }
    gans = min(ans, gans);
    next_permutation(tr.begin(), tr.end());
  }
  cout << gans;
  return 0;
}
