Problem:
 Score : 200 points    Problem Statement Takahashi and Aoki will have a battle using their monsters.  The health and strength of Takahashi's monster are A and B , respectively, and those of Aoki's monster are C and D , respectively.  The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...
Here, an attack decreases the opponent's health by the value equal to the attacker's strength.
The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.  If Takahashi will win, print Yes ; if he will lose, print No .      Constraints  1 \leq A,B,C,D \leq 100  All values in input are integers.         Input Input is given from Standard Input in the following format:  A  B  C  D       Output If Takahashi will win, print Yes ; if he will lose, print No .        Sample Input 1 10 9 10 10      Sample Output 1 No  First, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1 .  Next, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0 .  Takahashi's monster is the first to have 0 or less health, so Takahashi loses.       Sample Input 2 46 4 40 5      Sample Output 2 Yes

Solution (Python):
import math
a,b,c,d=map(int,input().split())
x,y=math.ceil(a/d),math.ceil(c/b)
print("Yes" if x>=y else "No")

Solution (Python):
def main():
    a,b,c,d = map(int,input().split())
    count = 0
    while True:
        if count%2 == 0:
            c -= b
        else:
            a -= d

        count += 1
        if a <= 0:
            print('No')
            return

        if c <= 0:
            print('Yes')
            return

main()

Solution (Python):
a,b,c,d=map(int,input().split())
while True:
	c-=b
	if c<=0:
		print("Yes")
		break
	a-=d
	if a<=0:
		print("No")
		break

Solution (Python):
a, b, c, d = map(int, input().split())
print('Yes' if -(-c//b) <= -(-a//d) else 'No')

Solution (Python):

a, b, c, d = map(int, input().split())

cnt1 = 0
cnt2 = 0

while a > 0:
	a -= d
	cnt1 += 1

while c >0:
	c -= b
	cnt2 += 1

print('Yes') if cnt1 >= cnt2 else print('No')

Solution (Python):
a,b,c,d = (int(num) for num in input().split())
while True:
    c -= b
    if c<=0:
        print("Yes")
        break
    a -= d
    if a<=0:
        print("No")
        break

Solution (Python):
a,b,c,d = map(int,input().split())
for i in range(10**10):
    if i%2 == 0:
        c-=b
    else:
        a-=d
    if a <= 0:
        print("No")
        break
    elif c <= 0:
        print("Yes")
        break

Solution (Python):
A,B,C,D=map(int,input().split())
cnt=0
while(1):
    if cnt==0:
        C-=B
        if C<=0:
            print("Yes")
            exit()
    else:
        A-=D
        if A<=0:
            print("No")
            exit()
    cnt=1-cnt

Solution (Python):
a, b, c, d = map(int, input().split())

while True:
    c -= b

    if c <= 0:
        print("Yes")
        break

    a -= d

    if a <= 0:
        print("No")
        break

Solution (Python):
a, b, c, d = map(int, input().split())
while a > 0 and c > 0:
    c -= b; a -= d
if c <= 0: print("Yes")
else: print("No")

Solution (Python):
mod = 10**9+7
import sys
from collections import Counter, defaultdict, deque
from itertools import product, permutations, combinations
from itertools import accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush
from math import ceil,floor
from copy import deepcopy
from heapq import heappop,heappush,heapify
import heapq





sys.setrecursionlimit(10 ** 6)

int1 = lambda x: int(x) - 1


p2D = lambda x: print(*x, sep="\n")

def II(): return int(sys.stdin.readline())

def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())




def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI(): return list(map(lambda x:int(x), sys.stdin.readline().split()))
def HI(): return list(map(lambda x:int(x)*(-1), sys.stdin.readline().split()))


a,b,c,d =MI()
while(1):
	c -= b
	if c<1:
		print('Yes')
		break
	a -= d
	if a<1:
		print('No')
		break

Solution (Python):
def main():
    a, b, c, d = map(int, input().split())

    for i in range(10000):
        if c <= 0:
            print('Yes')
            exit()
        if a <= 0:
            print('No')
            exit()
        if i % 2 == 0:
            c -= b
        else:
            a -= d

if __name__ == '__main__':
    main()

Solution (Python):
A,B,C,D = map(int,input().split())

while (True) :
    C -= B
    if (C <= 0) :
        print("Yes")
        break
    
    A -= D
    if (A <= 0) :
        print("No")
        break

Solution (Python):
a, b, c, d = map(int, input().split())

i = 0
while a > 0 and c > 0:
    if i % 2 == 0:
        c -= b
    else:
        a -= d
    i += 1

if c <= 0:
    print('Yes')
else:
    print('No')

Solution (Python):















mod = int(1e9+7)
INF = 1<<29
lINF = 1<<35

def readInt():
    return list(map(int,input().split()))

def main():
    a,b,c,d = readInt()
    tkhs = (a+d-1)//d
    aok = (c+b-1)//b
    if tkhs<aok:
        print("No")
    else:
        print("Yes")
    return

if __name__=='__main__':
    main()

Solution (Python):
a,b,c,d = map(int,input().split())
while True:
  if a > 0:
    c -= b
  else:
    print("No")
    exit()
  if c > 0:
    a -= d
  else:
    print("Yes")
    exit()

Solution (Python):
a, b, c, d = map(int, input().split())
while True:
    c -= b
    if c <= 0:
        ans = 'Yes'
        break
    a -= d
    if a <= 0:
        ans = 'No'
        break
print(ans)

Solution (Python):
a,b,c,d = map(int,input().split())

while True:
    c -= b
    if c <= 0:
        result = 'Yes'
        break
    a -= d
    if a <= 0:
        result = 'No'
        break
print(result)

Solution (Python):
import sys
import math
from collections import deque
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def S(): return sys.stdin.readline()
def LS(): return sys.stdin.readline().split()
def LS2(N): return [sys.stdin.readline().split() for i in range(N)]
def FILL(i,h,w): return [[i for j in range(w)] for k in range(h)]
def sisha(num,digit): return Decimal(str(num)).quantize(Decimal(digit),rounding=ROUND_HALF_UP)

MOD = 1000000007
INF = float("inf")
sys.setrecursionlimit(10**6+10)

input = sys.stdin.readline

A,B,C,D = MI()
while True:
    C -= B
    if C<=0:
        print('Yes')
        break
    A -= D
    if A<=0:
        print('No')
        break

Solution (Python):
a, b, c, d = map(int, input().split())
while a > 0 and c > 0:
    c -= b
    if c <= 0:
        print("Yes")
        break
    a -= d
    if a <= 0:
        print("No")
        break

Solution (Python):

MOD = 10 ** 9 + 7
INFI = 10**10

import math

import itertools
import heapq


import copy
from functools import lru_cache

def sosuhante(n):
    for k in range(2, int(math.sqrt(n))+1):
        if n% k ==0:
            return False
    return True
def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def kingaku(a,b,n):
    keta=len(str(n))
    return a*n+b*keta

def my_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default




def ret(a):
    c=[None]*(len(a)-1)
    if len(a)==1:
        return a[0]
    elif len(a)==0:
        return 0
    for i in range(1,len(a)):
        c[i-1]=abs(a[i]-a[i-1])
    return ret(c)


def main():

    a,b,c,d=map(int,input().split())
    ans="Yes"
    while True:
        c-=b
        if c<=0:
            ans="Yes"
            break
        a-=d
        if a<=0:
            ans="No"
            break

    print(ans)



if __name__ == "__main__":

    main()

Solution (Python):
my_hp, my_damage, enemy_hp, enemy_damage = map(int, input().split())


while True:
    enemy_hp -= my_damage
    if enemy_hp <= 0:
        print('Yes')
        break
    my_hp -= enemy_damage
    if my_hp <= 0:
        print('No')
        break

Solution (Python):
A, B, C, D = map(int, input().split())

while True:
    C -= B
    if C <= 0:
        print("Yes")
        exit()
    A -= D
    if A <= 0:
        print("No")
        exit()

Solution (Python):
A,B,C,D = map(int, input().split())

t1 = -(-C//B)
t2 = -(-A//D)

if t1 <= t2:
    print('Yes')
else:
    print('No')

Solution (Python):
A, B, C, D = map(int, input().split())

yes = ((A + D-1) // D >= (C + B-1) // B)

print('Yes' if yes else 'No')

Solution (Python):
A, B, C, D = map(int, input().split())

while True:
    C -= B
    if C <= 0:
        ans = "Yes"
        break
    A -= D
    if A <= 0:
        ans = "No"
        break

print(ans)

Solution (Python):
a,b,c,d = map(int,input().split())

while True:
    c = c - b
    if c <= 0:
        print("Yes")
        exit()
    a = a - d
    if a <= 0:
        print("No")
        exit()

Solution (Python):
import sys
import math  
import bisect  
import queue  


def input():
    return sys.stdin.readline().rstrip()


def main():
    A, B, C, D = map(int, input().split())

    turn_takahashi = True
    while True:
        if turn_takahashi:
            C -= B
            turn_takahashi = False
        else:
            A -= D
            turn_takahashi = True
        if C <= 0:
            return print("Yes")
        if A <= 0:
            return print("No")


if __name__ == '__main__':
    main()

Solution (Python):
A, B, C, D = map(int, input().split())
Aoki = (C+(B-1))//B
Takahashi = (A+(D-1))//D

if Takahashi >= Aoki:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c,d=map(int,input().split())
p,q=c//b+(c%b>0),a//d+(a%d>0)
print("Yes")if p<=q else print("No")

Solution (Python):
a, b, c, d = map(int, input().split())
if ((c+b-1)//b) <= ((a+d-1)//d): 
  print("Yes")
else:
  print("No")

Solution (Python):
A, B, C, D = map(int, input().split())
for i in range(10**5):
    if i%2 == 0:
        C -= B
        if C <= 0:
            print("Yes")
            exit()
    else:
        A -= D
        if A <= 0:
            print("No")
            exit()

Solution (Python):
A,B,C,D = map(int,input().split())

while A > 0 and C > 0:
    C -= B
    if C > 0:
        A -= D

if A <= 0:
    print("No")
else:
    print("Yes")

Solution (Python):
import math

a,b,c,d = map(int, input().split())

num1 = math.ceil(c/b)
num2 = math.ceil(a/d)

if num1 <= num2:
    print('Yes')
else:
    print('No')

Solution (Python):
a, b, c, d = map(int, input().split())
while a > 0 and c > 0:
    if c > 0:
        c -= b
        if c <= 0:
            print("Yes")
            break
    if a > 0:
        a -= d
        if a <= 0:
            print("No")
            break

Solution (Python):
A,B,C,D=map(int,input().split())
while True:
  C-=B
  if C<=0:
    print("Yes")
    exit()
  A-=D
  if A<=0:
    print("No")
    exit()

Solution (Python):
A,B,C,D = map(int,input().split())
while True:
    C -= B
    if C <= 0:
        print("Yes")
        exit()
    A -= D
    if A <= 0:
        print("No")
        exit()

Solution (Python):
A, B, C, D = map(int, input().split())
while 1:
    C -= B
    if C <= 0:
        print('Yes')
        exit()
    A -= D
    if A <= 0:
        print('No')
        exit()

Solution (Python):
a,b,c,d = map(int,input().split())
while True:
    c-=b
    if c<=0:
        print('Yes')
        exit(0)
    a-=d
    if a<=0:
        print('No')
        exit(0)

Solution (Python):
A,B,C,D = map(int,input().split())
while True:
    C = C-B
    if C <= 0:
        print("Yes")
        break
    A = A-D
    if A <= 0:
        print("No")
        break

Solution (Python):
a, b, c, d = map(int, input().split())

flag = True

while (a > 0 and c > 0):
    a -= d
    c -= b
    if a <= 0 and c > 0:
        flag = False

if flag:
    print("Yes")
else:
    print("No")

Solution (Python):

x = [int(x) for x in input().split()]

import math

if math.ceil(x[0]/x[3]) >= math.ceil(x[2]/x[1]):
    print("Yes")
else:
    print("No")

Solution (Python):
a, b, c, d = map(int, input().split())

while True:
    c -= b

    if c <= 0:
        print('Yes')
        break

    a -= d
    if a <= 0:
        print('No')
        break

Solution (Python):
a,b,c,d = map(int,input().split())
while(1):
    c -= b
    if c < 1:
        print("Yes")
        exit()
    a -= d
    if a < 1:
        print("No")
        exit()

Solution (Python):
A, B, C, D = map(int, input().split())

while True:
	C -= B
	if C <= 0:
		print("Yes")
		break
	A -= D
	if A <= 0:
		print("No")
		break

Solution (Python):
a,b,c,d = map(int,input().split())

def ceil(a, b):
   return a // b + (a % b > 0)

aa = ceil(a,d)
bb = ceil(c,b)


if aa < bb:
    print("No")
else:
    print("Yes")

Solution (Python):
a, b, c, d = map(int, input().split())
while True:
    c -= b
    if c<=0:
        print('Yes')
        break
    a -= d
    if a<=0:
        print('No')
        break

Solution (Python):
A,B,C,D=map(int,input().split())
while 1:
    C-=B
    if C<=0:
        r=1;break
    A-=D
    if A<=0:
        r=0;break
print(['No','Yes'][r])

Solution (Python):
from sys import stdin
input = stdin.readline

A, B, C, D = map(int, input().split())

while True:
    C -= B

    if C <= 0:
        print("Yes")
        exit()

    A -= D

    if A <= 0:
        print("No")
        exit()

Solution (Python):
A, B, C, D = map(int, input().split())

while(1):
    C = C - B
    if C <= 0:
        print("Yes")
        break
    A = A - D
    if A <= 0:
        print("No")
        break

Solution (Python):
from sys import stdin
def main():
    
    readline=stdin.readline
    a,b,c,d=map(int,readline().split())
    flag=0
    while a>=1 and c>=1:
        if flag==0:
            c-=b
            flag=1
        else:
            a-=d
            flag=0
    
    if a>0:
        print("Yes")
    else:
        print("No")

if __name__=="__main__":
    main()

Solution (Python):
A,B,C,D=map(int,input().split())
while True:
  C-=B
  if C<=0:
    print('Yes')
    break
  A-=D
  if A<=0:
    print('No')
    break

Solution (Python):
A,B,C,D = map(int,input().split())

for _ in range(100):
    if C - B <= 0:
        print('Yes')
        break
    else:
        C -= B
    if A - D <= 0:
        print('No')
        break
    else:
        A -= D

Solution (Python):
a, b, c, d = map(int, input().split())
while b and d:
    c -= b
    if c <= 0:
        print('Yes')
        break
    a -= d
    if a <= 0:
        print('No')
        break

Solution (Python):

a,b,c,d = map(int,input().split())

while(True):
    c -= b
    if c <= 0:
        print("Yes")
        exit()
    a -= d
    if a <= 0:
        print("No")
        exit()

Solution (Python):

a,b,c,d = list(map(int,input().split()))

while True:
    c-=b
    if c<=0:
        print("Yes")
        break
    a-=d
    if a <= 0:
        print("No")
        break

Solution (Python):
A,B,C,D = map(int,input().split())

a = (A-1) // D
b = (C-1) // B

if a >= b:
	print("Yes")
else:
	print("No")

Solution (Python):
def main():

    from bisect import bisect_left as bl, bisect_right as br, insort
    import sys
    import heapq
    
    from collections import defaultdict as dd, deque
    def data(): return sys.stdin.readline().strip()
    def mdata(): return map(int, data().split())
    out = sys.stdout.write
    

    a,b,c,d=mdata()
    k1=a//d
    if a%d!=0:
        k1+=1
    k2=c//b
    if c%b!=0:
        k2+=1
    if k1>=k2:
        print("Yes")
    else:
        print("No")




if __name__ == '__main__':
    main()

Solution (Python):
A, B, C, D = map(int, input().split())
i = 0
while A > 0 and C > 0:
    if i % 2 == 0: C -= B
    else: A -= D
    i += 1
print('Yes' if A > 0 else 'No')

Solution (Python):
a,b,c,d=map(int,input().split())
while 1:
    c-=b
    if c<=0:
        print("Yes")
        exit()
    a-=d
    if a<=0:
        print("No")
        exit()

Solution (Python):
A, B, C, D =  [int(i) for i in input().split()]
while(True):
    C -= B
    if C <= 0:
        print("Yes")
        break
    A -= D
    if A <= 0:
        print("No")
        break

Solution (Python):

import sys




import numpy as np

"""Template"""


class IP:
    """
    入力を取得するクラス
    """

    def __init__(self):
        self.input = sys.stdin.readline

    def I(self):
        """
        1文字の取得に使います
        :return: int
        """
        return int(self.input())

    def S(self):
        """
        1文字の取得(str
        :return: str
        """
        return self.input()

    def IL(self):
        """
        1行を空白で区切りリストにします(int
        :return: リスト
        """
        return list(map(int, self.input().split()))

    def SL(self):
        """
        1行の文字列を空白区切りでリストにします
        :return: リスト
        """
        return list(map(str, self.input().split()))

    def ILS(self, n):
        """
        1列丸々取得します(int
        :param n: 行数
        :return: リスト
        """
        return [int(self.input()) for _ in range(n)]

    def SLS(self, n):
        """
        1列丸々取得します（str
        :param n: 行数
        :return: リスト
        """
        return [self.input() for _ in range(n)]

    def SILS(self, n):
        """
        Some Int LineS
        横に複数、縦にも複数
        :param n: 行数
        :return: list
        """
        return [self.IL() for _ in range(n)]

    def SSLS(self, n):
        """
        Some String LineS
        :param n: 行数
        :return: list
        """
        return [self.SL() for _ in range(n)]


"""ここからメインコード"""


def main():
    
    r, e = range, enumerate
    ip = IP()

    """この下から書いてね"""
    
    
    
    
    
    a, b, c, d = ip.IL()
    ans = "Yes"
    while True:
        c -= b
        if c <= 0:
            ans = "Yes"
            break

        a -= d
        if a <= 0:
            ans = "No"
            break

    print(ans)



main()

Solution (Python):
A,B,C,D= list(map(int, input().split()))

while True:
  C -= B
  if C <1:
    print('Yes')
    break
  A -= D
  if A <1:
    print('No')
    break

Solution (Python):
A,B,C,D=map(int,input().split())
if (C+B-1)//B>(A+D-1)//D:
    print("No")
else:
    print("Yes")

Solution (Python):
a,b,c,d = map(int,input().split())
while True:
  c -= b
  if c <= 0:
    print("Yes")
    quit()
  a -= d
  if a <= 0:
    print("No")
    quit()

Solution (Python):

import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub


input = sys.stdin.buffer.readline
INF = 2**62-1

def read_int():
    return int(input())


def read_int_n():
    return list(map(int, input().split()))


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(A, B, C, D):
    while True:
        C -= B
        if C <= 0:
            return 'Yes'
        A -= D
        if A <= 0:
            return 'No'


def main():
    A, B, C, D = read_int_n()
    print(slv(A, B, C, D))


if __name__ == '__main__':
    main()

Solution (Python):
def main():
    a,b,c,d = map(int, input().split())

    while True:
        c -= b
        if c<=0:
            print('Yes')
            return
        a -= d
        if a <= 0:
            print('No')
            return


if __name__ == '__main__':
    main()

Solution (Python):
A, B, C, D = map(int, input().split())
cnt = 0
while True:
    if cnt % 2 == 0:
        C -= B
        if C <= 0:
            print('Yes')
            exit()
    else:
        A -= D
        if A <= 0:
            print('No')
            exit()
    cnt += 1

Solution (Python):
A, B, C, D = [int(x) for x in input().split()]

while True:
    C -= B
    if C <= 0:
        print("Yes")
        break
    A -= D
    if A <= 0:
        print("No")
        break

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
printV = lambda x: print(*x, sep="\n")
printH = lambda x: print(" ".join(map(str,x)))
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LII(rows_number): return [II() for _ in range(rows_number)]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
mo = 10**9+7

def main():
	a,b,c,d = MI()
	while (a > 0):
		a-=d
		c-=b
	if(c<=0):
		print("Yes")
	else:
		print("No")

if __name__ == '__main__':
	main()

Solution (Python):
a,b,c,d = map(int,input().split())
ans = "No"
while True:
    c -= b
    if c <= 0:
        ans = "Yes"
        break
    a -= d
    if a <= 0:
        ans = "No"
        break
print(ans)

Solution (Python):
a, b, c, d = map(int, input().split())

count = 1
while a and c:
    if count % 2:
        c -= b
    else:
        a -= d
    if a <= 0:
        print("No")
        break
    if c <= 0:
        print("Yes")
        break
    count += 1

Solution (Python):
A, B, C, D = map(int, input().split())

while True:
    C -= B
    if C <= 0:
        print('Yes')
        break
    
    A -= D
    if A <= 0:
        print('No')
        break

Solution (Python):
import math

a,b,c,d = map(int,input().split())

ans1 = math.ceil(a / d)
ans2 = math.ceil(c / b)

if ans1 < ans2:
  print('No')
else:
  print('Yes')

Solution (Python):
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))
a,b,c,d = iim()
cnt = 0
while a > 0 and c > 0:
    if cnt%2 == 0:
        c -= b
    else:
        a -= d
    cnt += 1

print('Yes' if cnt%2 == 1 else 'No')

Solution (Python):
def main():
    A, B, C, D = map(int, input().split())
    while True:
        if C - B <= 0:
            return 'Yes'
        C -= B
        if A - D <= 0:
            return 'No'
        A -= D

print(main())

Solution (Python):


a,b,c,d = map(int, input().split())

while(True):
    c = c - b
    if c<=0:
        print("Yes")
        break
    else:
        a = a - d
        if a <= 0:
            print("No")
            break
        else:
            pass

Solution (Python):
A, B, C, D = map(int, input().split())

while A > 0 or C > 0:
    C -= B
    if C <= 0:
        break
    A -= D
    if A <= 0:
        break

if A <= 0:
    print("No")
else:
    print("Yes")

Solution (Python):
a, b, c, d = map(int, input().split())
turn = True

while (a > 0 and c > 0):
    if turn:
        c -= b
    else:
        a -= d
    turn = not turn

if a > c:
    print('Yes')
else:
    print('No')

Solution (Python):

a,b,c,d = map(int,input().split())

while a > 0 or c > 0:
    c = c - b
    if c <= 0:
        print("Yes")
        break
    a = a - d
    if a <= 0:
        print("No")
        break

Solution (Python):
import sys

stdin = sys.stdin
inf = 1 << 60
mod = 1000000007

ni      = lambda: int(ns())
nin     = lambda y: [ni() for _ in range(y)]
na      = lambda: list(map(int, stdin.readline().split()))
nan     = lambda y: [na() for _ in range(y)]
nf      = lambda: float(ns())
nfn     = lambda y: [nf() for _ in range(y)]
nfa     = lambda: list(map(float, stdin.readline().split()))
nfan    = lambda y: [nfa() for _ in range(y)]
ns      = lambda: stdin.readline().rstrip()
nsn     = lambda y: [ns() for _ in range(y)]
ncl     = lambda y: [list(ns()) for _ in range(y)]
nas     = lambda: stdin.readline().split()

a, b, c, d = na()

while a > 0 and c > 0:
    c -= b
    if c <= 0:
        break
    a -= d
    if a <= 0:
        break

if a <= 0:
    print("No")
else:
    print("Yes")

Solution (Python):
A,B,C,D=map(int, input().split())

while True:
    C -= B
    if C < 1:
        print("Yes")
        exit()
    A -= D
    if A < 1:
        print("No")
        exit()

Solution (Python):
A,B,C,D=map(int,input().split())
f=0
while True:
    C-=B
    if C<=0:
        f=1
    if f==1:
        break
    A-=D
    if A<=0:
        f=2
    if f==2:
        break
print("Yes" if f==1 else "No")

Solution (Python):
A, B, C, D = map(int, input().split())

while True:
    C -= B
    if C <= 0:
        print('Yes')
        break
    A -= D
    if A <= 0:
        print('No')
        break

Solution (Python):
a,b,c,d=map(int,input().split())
while True:
    c-=b
    if c<=0:
        print('Yes')
        exit()
    a-=d
    if a<=0:
        print('No')
        exit()

Solution (Python):
A, B, C, D = map(int, input().split())

while True:
    C -= B
    if C <= 0:
        print("Yes")
        break
    A -= D
    if A <= 0:
        print("No")
        break

Solution (Python):
import math
a,b,c,d = map(int,input().split())
if math.ceil(c/b) > math.ceil(a/d):
  print("No")
else:
  print("Yes")

Solution (Python):
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)


def get_nums_l():
    return [ int(s) for s in input().split(" ")]


def get_nums_n(n):
    return [ int(input()) for _ in range(n)]


def get_all_int():
    return map(int, open(0).read().split())

def log(*args):
    print("DEBUG:", *args, file=sys.stderr)


a,b,c,d = get_all_int()

x = (c+b-1)//b
y = (a+d-1)//d

print("Yes" if x <= y else "No")

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin, log, log10, gcd
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

def debug(*args):
    if debugmode:
        print(*args)
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def FLOAT(): return float(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 1, 0, -1, 1, -1, -1, 1]
dy = [1, 0, -1, 0, 1, -1, 1, -1]
debugmode = True

a, b, c, d = MAP()
i = 0
while True:
    if i % 2:
        a -= d
    else:
        c -= b
    i += 1
    if a <= 0 and c > 0:
        print('No')
        exit()
    elif a > 0 and c <= 0:
        print('Yes')
        exit()

Solution (Python):
a, b, c, d = map(int, input().split())
while True:
    c -= b
    if c <= 0:
        print("Yes")
        break
    a -= d
    if a <= 0:
        print("No")
        break

Solution (Python):
a, b, c, d = map(int, input().strip().split())

while True:
    c -= b
    if c <= 0:
        print('Yes')
        break
    a -= d
    if a <= 0:
        print('No')
        break

Solution (Python):
a,b,c,d=map(int,input().split())
while 1:
    c-=b
    a-=d
    if c<=0:
        print("Yes")
        exit()
    if a<=0:
        print("No")
        exit()

Solution (Python):
a,b,c,d=map(int,input().split())

while(1):
  c=c-b
  if c<=0:
    print("Yes")
    break
  a=a-d
  if a<=0:
    print("No")
    break

Solution (Python):
A, B, C, D = map(int, input().split())

while True:
    C -= B
    if C <= 0:
        print('Yes')
        break
    A -= D
    if A <= 0:
        print('No')
        break

Solution (Python):
from math import ceil

A,B,C,D = map(int,input().split())

if ceil(C/B) <= ceil(A/D):
  print("Yes")
else:
  print("No")

Solution (Python):

import sys

A,B,C,D = map(int,input().split())

while True:
    C -= B
    if C<=0:
        print('Yes')
        sys.exit()
    
    A -= D
    if A<=0:
        print('No')
        sys.exit()

Solution (Python):
a,b,c,d = map(int,input().split())

while True:
  c -= b
  if c<=0:
    print('Yes')
    break
  a -= d
  if a<=0:
    print('No')
    break

Solution (Python):
a, b, c, d = map(int, input().split())

import math
if math.ceil(c/b) <= math.ceil(a/d):
  print('Yes')
else:
  print('No')

Solution (Python):
a, b, c, d = map(int, input().split())
turn_t = True
while True:
    if turn_t:
        c -= b
        if c <= 0:
            print('Yes')
            break
    else:
        a -= d
        if a <= 0:
            print('No')
            break
    turn_t = not turn_t

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))

a,b,c,d=MAP()

while True:
    c-=b
    if c<=0:
        print("Yes")
        exit()
    a-=d
    if a<=0:
        print("No")
        exit()

Solution (Python):
def main():
    a, b, c, d = map( int, input().split())
    for i in range(300):
        c -= b
        if c <= 0:
            print("Yes")
            return
        a -= d
        if a <= 0:
            print("No")
            return
if __name__ == '__main__':
    main()

Solution (Python):
import sys
sys.setrecursionlimit(1000000)

def solve(A, B, C, D):
    while A > 0 or C > 0:
        C -= B
        if C <= 0:
            break
        A -= D

    if A <= 0:
        return "No"
    return "Yes"

if __name__ == "__main__":
    A, B, C, D = tuple(map(int, input().split(" ")))
    print(solve(A, B, C, D))

Solution (Python):
a,b,c,d = map(int, input().split())

while a > 0 or c > 0:
    c -= b
    if c <= 0:
        print('Yes')
        break
    a -= d
    if a <= 0:
        print('No')
        break

Solution (Python):
A,B,C,D = map(int,input().split())

while A>0 and C>0:
    C-=B
    if C<=0:
        print("Yes")
        break
    A-=D
    if A<=0:
        print("No")
        break

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()

def main():
    A, B, C, D = map(int, input().split())
    while True:
        C -= B
        if C <= 0:
            print('Yes')
            exit()
        A -= D
        if A <= 0:
            print('No')
            exit()

if __name__ == '__main__':
    main()

Solution (Python):
a,b,c,d = map(int, input().split())

while 1:
    c-=b
    if c<=0:
        print('Yes')
        break
    a-=d
    if a<=0:
        print('No')
        break

Solution (Python):
a,b,c,d = map(int, input().split())

while True:
  c -= b
  if c <= 0:
    print('Yes')
    break
  a -= d
  if a <= 0:
    print('No')
    break

Solution (Python):
A, B, C, D = map(int, input().split())


while True:
    C -= B
    if C <= 0:
        ans = 'Yes'
        break
    A -= D
    if A <= 0:
        ans = 'No'
        break
print(ans)