#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const int MAX_N = int(1e6) + 10;
const long long int MOD = 1e9 + 7;
const long long int INF = 1e18;
inline long long int mul(long long int a, long long int b) {
  a = (a + MOD) % MOD;
  b = (b + MOD) % MOD;
  long long int c = a * b;
  c = (c + MOD) % MOD;
  return c;
}
inline long long int add(long long int a, long long int b) {
  a = (a + MOD) % MOD;
  b = (b + MOD) % MOD;
  long long int ans = (a + b);
  ans = (ans + MOD) % MOD;
  return ans;
}
long long int power(long long int a, long long int b, long long int c) {
  long long int ans = 1;
  while (b) {
    if (b & 1) {
      ans = mul(ans, a);
    }
    a = mul(a, a);
    b = b / 2;
  }
  return ans;
}
template <class T1, class T2>
istream &operator>>(istream &in, pair<T1, T2> &P) {
  in >> P.first >> P.second;
  return in;
}
template <class T1, class T2>
ostream &operator<<(ostream &out, const pair<T1, T2> &P) {
  out << "(" << P.first << ", " << P.second << ")";
  return out;
}
template <class T>
istream &operator>>(istream &in, vector<T> &arr) {
  for (auto &x : arr) in >> x;
  return in;
}
template <class T>
ostream &operator<<(ostream &out, const vector<T> &arr) {
  for (auto &x : arr) out << x << ' ';
  cout << "\n";
  return out;
}
template <class T>
istream &operator>>(istream &in, deque<T> &arr) {
  for (auto &x : arr) in >> x;
  return in;
}
template <class T>
ostream &operator<<(ostream &out, const deque<T> &arr) {
  for (auto &x : arr) out << x << ' ';
  cout << "\n";
  return out;
}
mt19937 rnd(time(0));
inline long long int gcd(long long int a, long long int b) {
  while (b) a %= b, swap(a, b);
  return a;
}
struct SOS {
  long long int *dp;
  int limit;
  vector<int> &arr;
  SOS(int _limit, vector<int> &v) : arr(v) {
    limit = _limit;
    dp = new long long int[(1 << limit) + 10];
  }
  void init() {
    for (int i = 0; i < (1 << limit); i++) {
      dp[i] = 0;
    }
    for (int i = 0; i < arr.size(); i++) {
      dp[arr[i]]++;
    }
  }
  void build1() {
    for (int i = 0; i < limit; i++) {
      for (int j = 0; j < (1 << limit); j++) {
        if (j & (1 << i)) {
          dp[j] = add(dp[j], dp[j ^ (1 << i)]);
        }
      }
    }
  }
  void build2() {
    for (int i = 0; i < limit; i++) {
      for (int j = (1 << limit) - 1; j >= 0; j--) {
        if (j & (1 << i)) {
          dp[j ^ (1 << i)] = add(dp[j ^ (1 << i)], dp[j]);
        }
      }
    }
  }
};
int find(int arr[], int x) {
  while (x != arr[x]) {
    x = arr[x];
  }
  return x;
}
void connect(int x, int arr[], int size[], int comp[], int y) {
  int rootA = find(arr, x);
  int rootB = find(arr, y);
  if (rootA == rootB) return;
  if (size[rootA] < size[rootB]) {
    arr[rootA] = rootB;
    size[rootB] += size[rootA];
    comp[rootB] = min(comp[rootA], comp[rootB]);
  } else {
    arr[rootB] = rootA;
    size[rootA] += size[rootB];
    comp[rootA] = min(comp[rootA], comp[rootB]);
  }
}
const int N = 2e5 + 5;
int tree[26][500005];
void update(int x, int j, int v) {
  while (x < 500005) {
    tree[j][x] += v;
    x += x & (-x);
  }
}
int query(int x, int j) {
  int ans = 0;
  while (x) {
    ans += tree[j][x];
    x -= x & (-x);
  }
  return ans;
}
void combine(int x, int y, int arr[], int size[]) {
  int rootA = find(arr, x);
  int rootB = find(arr, y);
  if (rootA == rootB) return;
  if (size[rootA] < size[rootB]) {
    arr[rootA] = rootB;
    size[rootB] += size[rootA];
  } else {
    arr[rootB] = rootA;
    size[rootA] += size[rootB];
  }
}
int a[505][505];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n, a, b, c;
  cin >> n >> a >> b >> c;
  if (n < b) {
    cout << n / a << endl;
  } else {
    long long int low = 0;
    long long int high = n / (b - c);
    long long int ans = 0;
    while (low <= high) {
      long long int mid = (low + high) / 2LL;
      if (n - mid * (b - c) >= b) {
        ans = mid;
        low = mid + 1;
      } else {
        high = mid - 1;
      }
    }
    long long int x = n / a;
    long long int y = ans;
    ans = n - ans * (b - c) - (b - c);
    y++;
    y = y + ans / a;
    x = max(x, y);
    cout << x << endl;
  }
}
