#include <bits/stdc++.h>
using namespace std;
template <class T>
void splitstr(const string &s, vector<T> &out) {
  istringstream in(s);
  out.clear();
  copy(istream_iterator<T>(in), istream_iterator<T>(), back_inserter(out));
}
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
static void redirect(int argc, const char **argv) {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  if (argc > 1) {
    static filebuf f;
    f.open(argv[1], ios::in);
    cin.rdbuf(&f);
    if (!cin) {
      cerr << "Failed to open '" << argv[1] << "'" << endl;
      exit(1);
    }
  }
  if (argc > 2) {
    static filebuf f;
    f.open(argv[2], ios::out | ios::trunc);
    cout.rdbuf(&f);
    if (!cout) {
      cerr << "Failed to open '" << argv[2] << "'" << endl;
    }
  }
}
static int a, b, n;
static int recurse(int p, int q, int part) {
  if (p == 0 && q == 0) return 0;
  int ans = INT_MAX;
  if (p > 0) {
    if (part >= a)
      ans = min(ans, recurse(p - 1, q, part - a));
    else
      ans = min(ans, 1 + recurse(p - 1, q, n - a));
  }
  if (q > 0) {
    if (part >= b)
      ans = min(ans, recurse(p, q - 1, part - b));
    else
      ans = min(ans, 1 + recurse(p, q - 1, n - b));
  }
  return ans;
}
int main(int argc, const char **argv) {
  redirect(argc, argv);
  cin >> n >> a >> b;
  cout << recurse(4, 2, 0) << '\n';
  return 0;
}
