#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, h, w;
  cin >> n >> h >> w;
  int db = 1, actN = n;
  pair<int, int> v1(h, 4), v2(w, 2);
  if (h > w) {
    pair<int, int> sv = v1;
    v1 = v2;
    v2 = sv;
  }
  while (v1.second + v2.second != 0) {
    int sv1 = actN, sv1db = 1;
    int sv2 = actN, sv2db = 1;
    while (v1.second > 0 && sv1 - v1.first >= 0) {
      sv1 -= v1.first;
      sv1db++;
    }
    while (v2.second > 0 && sv2 - v2.first >= 0) {
      sv2 -= v2.first;
      sv2db++;
    }
    if (v2.second > 0 && sv1 * sv1db >= sv2 * sv2db && actN >= v2.first) {
      actN -= v2.first;
      v2.second--;
    } else if (v1.second > 0 && sv1 * sv1db <= sv2 * sv2db &&
               actN >= v1.first) {
      actN -= v1.first;
      v1.second--;
    } else {
      actN = n;
      db++;
    }
  }
  int f1 = 4, f2 = 2;
  if (h < w) {
    int sv = h;
    h = w;
    w = sv;
    sv = f1;
    f1 = f2;
    f2 = sv;
  }
  int db1 = 1;
  actN = n;
  vector<int> mod;
  for (int i = 0; i < f1; i++) {
    if (actN >= h) {
      actN -= h;
    } else {
      mod.push_back(actN);
      actN = n - h;
      db1++;
    }
  }
  int wcount = f2, i = 0;
  while (i < mod.size() && wcount > 0) {
    if (mod[i] >= w) {
      mod[i] -= w;
      wcount--;
    } else {
      i++;
    }
  }
  if (wcount > 0) {
    for (int i = 0; i < wcount; i++) {
      if (actN >= w) {
        actN -= w;
      } else {
        actN = n - w;
        db1++;
      }
    }
  }
  cout << min(db, db1);
  return 0;
}
