#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, a, b;
  cin >> n >> a >> b;
  vector<int> p;
  for (int i = 0; i < 4; i += 1) {
    p.push_back(a);
  }
  for (int i = 0; i < 2; i += 1) {
    p.push_back(b);
  }
  int c = 0, d;
  int mi = 6;
  for (int i = 0; i < 6; i += 1) {
    for (int j = 0; j < 6; j += 1) {
      if (i == j) continue;
      for (int k = 0; k < 6; k += 1) {
        if (i == k || j == k) continue;
        for (int l = 0; l < 6; l += 1) {
          if (i == l || j == l || k == l) continue;
          for (int m = 0; m < 6; m += 1) {
            if (i == m || j == m || k == m || l == m) continue;
            for (int n1 = 0; n1 < 6; n1 += 1) {
              if (i == n1 || j == n1 || k == n1 || l == n1 || m == n1) continue;
              c = 0;
              d = n;
              d -= p[i];
              c++;
              if (d >= p[j])
                d -= p[j];
              else {
                d = n;
                d -= p[j];
                c++;
              }
              if (d >= p[k])
                d -= p[k];
              else {
                d = n;
                d -= p[k];
                c++;
              }
              if (d >= p[l])
                d -= p[l];
              else {
                d = n;
                d -= p[l];
                c++;
              }
              if (d >= p[m])
                d -= p[m];
              else {
                d = n;
                d -= p[m];
                c++;
              }
              if (d >= p[n1])
                d -= p[n1];
              else {
                d = n;
                d -= p[n1];
                c++;
              }
              if (mi > c) mi = c;
            }
          }
        }
      }
    }
  }
  cout << mi << endl;
  return 0;
}
