/* Hemant Gupta */
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define show(v)                             \
    for (int i = 0; i < (int)v.size(); i++) \
        cout << v[i] << (i == (int)v.size() - 1 ? "\n" : " ");
#define pb push_back
#define INF 1e18 + 5
const int MOD = 1e9 + 7;
const int N = 3e5 + 5;
vector<int> adj[N];
vector<bool> vis(N), take(N);
void test_case()
{
    char a[3];
    cin >> a[0] >> a[1] >> a[2];
    if (a[0] == a[1] && a[1] == a[2])
        cout << "Won";
    else
        cout << "Lost";
}

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    test_case();
    return 0;
}
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <sstream>
#include <iomanip>
#include <set>
#include <cmath>
#include <bitset>
#include <queue>
#include <climits>
using namespace std;

int main(){
    int a, b, c, d;
    cin >> a >> b >> c >> d;

    int right = c * d - b;

    if (right <=0){
        cout << -1 << endl;
    }
    else{
        float thresh = double(a) / right;
        int ans = ceil(thresh);
        cout << ans << endl;
    }
}