#include <bits/stdc++.h>
using namespace std;
const long long OO = 2e18;
const double pi = 2 * acos(0.0);
bool isprime(long long int a) {
  if (a == 1) {
    return false;
  }
  for (int i = 2; i * i <= a; i++) {
    if (a % i == 0) {
      return false;
    }
  }
  return true;
}
bool iscoprime(int a, int b) {
  int i;
  for (i = 2; i <= min(a, b); i++) {
    if (a % i == 0 && b % i == 0) {
      return false;
    }
  }
  return true;
}
long long gcd(long long a, long long b) {
  if (b == 0) {
    return a;
  } else {
    return gcd(b, a % b);
  }
}
int maxA(vector<int> a) {
  int m = 0;
  for (int i = 0; i < a.size(); i++) {
    m = max(m, a[i]);
  }
  return m;
}
int minA(vector<int> a) {
  int m = 100000;
  for (int i = 0; i < a.size(); i++) {
    m = min(m, a[i]);
  }
  return m;
}
vector<int> freqN(vector<int> a, int n) {
  vector<int> f(n);
  f = {0};
  for (int i = 0; i < a.size(); i++) {
    f[a[i]]++;
  }
  return f;
}
vector<int> freqA(vector<int> a) {
  vector<int> f(26);
  f = {0};
  for (int i = 0; i < a.size(); i++) {
    f[a[i] - '0']++;
  }
  return f;
}
bool mycomp(const pair<long int, long int>& p1,
            const pair<long int, long int>& p2) {
  if (p1.second < p2.second)
    return true;
  else if (p1.second == p2.second)
    return p1.first < p2.first;
  else
    return false;
}
unsigned int rightmostsetbit(unsigned int n) { return n & -n; }
bool cmp(pair<string, int>& p1, pair<string, int>& p2) {
  if (p1.second == p2.second) return p1.first < p2.first;
  return p1.second > p2.second;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  long long int n, a, b;
  cin >> n >> a >> b;
  long long int req_a = 4, req_b = 2;
  long long int have_a, have_b;
  long long int temp;
  long long int count = 0;
  bool flag = false;
  if ((n - b) % a == 0) {
    while (req_a > 0) {
      if (req_b > 0) {
        temp = n - b;
        req_b--;
      } else {
        temp = n;
      }
      have_a = temp / a;
      if (have_a > req_a) {
        temp -= req_a * a;
        req_a = 0;
      } else {
        req_a -= have_a;
      }
      count++;
    }
    if (temp) {
      req_b -= temp / b;
    }
    while (req_b > 0) {
      req_b -= n / b;
      count++;
    }
  } else if (a >= b) {
    while (req_a > 0) {
      temp = n;
      have_a = temp / a;
      if (have_a > req_a) {
        temp -= (req_a * a);
        req_a = 0;
      } else {
        req_a -= have_a;
        temp = temp % a;
      }
      have_b = temp / b;
      req_b -= have_b;
      count++;
    }
    while (req_b > 0) {
      temp = n;
      have_b = temp / b;
      if (have_b >= req_b) {
        count++;
        break;
      }
      req_b -= have_b;
      count++;
    }
  } else {
    while (req_b > 0) {
      temp = n;
      have_b = temp / b;
      if (have_b > req_b) {
        temp -= (req_b * b);
        req_b = 0;
      } else {
        req_b -= have_b;
        temp = temp % b;
      }
      have_a = temp / a;
      req_a -= have_a;
      count++;
    }
    while (req_a > 0) {
      temp = n;
      have_a = temp / a;
      if (have_a >= req_a) {
        count++;
        break;
      }
      req_a -= have_a;
      count++;
    }
  }
  cout << count << endl;
}
