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):

a,b,c,d = map(int, input().split())
cnta = 0
cntc = 0
while a > 0:
    a -= d
    cnta += 1

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



if cnta >= cntc:
    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 = c - b
    if 0 >= c:
      print("Yes")
      exit()
    if a > 0:
      a = a - d
      if 0>= a:
        print("No")

Solution (Python):
def main():
  a, b, c, d = list(map(int, input().split()))
  
  count1 = 0
  count2 = 0
  
  while c > 0:
    c -= b
    count1 += 1
    
  while a > 0:
    a -= d
    count2 += 1
    
  if count1 <= count2:
    print('Yes')
  else:
    print('No')
    
  
main()

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 a > 0 and 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 = 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 a>0 and c>0:
    a -= d
    c -= b

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

    elif a <= 0:
        print("No")
        exit()

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

Solution (Python):
a,b,c,d=map(int,input().split())
cntt=0
cnta=0
while a>0:
    a-=d
    cntt+=1
while c>0:
    c=c-b
    cnta+=1

if cntt>=cnta:
    print("Yes")
else:
    print("No")

Solution (Python):
import numpy as np
def cumsum(x):
    return list(np.cumsum(x))

def cumsum_number(N,K,x):
    ans=[0]*(N-K+1)
    number_cumsum = cumsum(x)
    number_cumsum.insert(0,0)
    for i in range(N-K+1):
        ans[i]=number_cumsum[i+K]-number_cumsum[i]
    return ans
"""
int 
float 


for name in fruits: 
    print(name)


list0 = [] 
list0 = [1,2,3,4] 
list0 = [0]*10 
list1= [i for i in range(10)] 
list1 = list(map(int, input().split()))　
number=[int(input()) for i in range(int(input()))] 
list1 = list1 + [6, 7, 8] 
list2.append(34) 
list.insert(3,10) 
len(list4) 
max(sa) 
list5.count(2) 
list1.sort() 
list1.sort(reverse=True)  
set(list1) 
sum([2,3,   ,3]) 

abs(a) 
max(a,b) min(a,b) 
text1 = text1.replace("34","test") 

exit(0) 

cumsum(リスト) 
cumsum_number(N,K,x) 
"""
A,B,C,D=map(int,input().split())
aoki=C
takahashi=A
while True:
    aoki = aoki-B
    if aoki<=0:
        print("Yes")
        exit(0)
    takahashi= takahashi-D
    if takahashi<=0:
        print("No")
        exit(0)

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 sys
import itertools

import time
import math
 
sys.setrecursionlimit(10 ** 7)
 
from collections import defaultdict
 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

i = 0
while True:
    if i % 2 == 0:
        C -= B
        if C <= 0:
            print("Yes")
            break
    else:
        A -= D
        if A <= 0:
            print("No")
            break
    i += 1

Solution (Python):
a,b,c,d = map(int, input().split())
e = a//d
f = a%d
if(not(f==0)):
  e+=1
g = c//b
h = c%b
if(not(h==0)):
  g+=1
if(e>=g):
  print("Yes")
else:
  print("No")

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

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

if A//D+int(A%D!=0) >= C//B+int(C%B!=0):
    print('Yes')
else:
    print('No')

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 True:
    c -= b
    if 0>=c:
        print("Yes")
        break
    a -= d
    if 0>=a:
        print("No")
        break

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

HP_t = [A]
HP_a = [C]

while HP_t[-1] > 0:
  HP_t.append(HP_t[-1] - D)
  HP_a.append(HP_a[-1] - B)

if HP_a[-1] > 0:
  print("No")
else:
  print("Yes")

Solution (Python):
def resolve():
	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

resolve()

Solution (Python):
def main():
    a,b,c,d=map(int,input().split())
    while True:
        c -= b
        if c < 1:
            break
        a -= d
        if a < 1:
            break
    print("Yes" if c < 1 else "No")
    
if __name__ == "__main__":
    main()

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

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

if y >= x:
    print('Yes')
else:
    print('No')

Solution (Python):
def battle():
    condition = input()
    condition_list = condition.split()
    A = int(condition_list[0])
    B = int(condition_list[1])
    C = int(condition_list[2])
    D = int(condition_list[3])
    
    while True:
        C -= B
        if C <= 0:
            print('Yes')
            return
        
        A -= D
        if A <= 0:
            print('No')
            return

battle()

Solution (Python):
import sys
a, b, c, d = map(int, input().split())
while a > 0 and c > 0:
    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())
x=a//d
y=c//b
if y<x:
    print('Yes')
elif y==x:
    if c%b==0:
        print('Yes')
    else:
        if a%d==0:
            print('No')
        else:
            print('Yes')
            
elif y==x+1:
    if c%b==0:
        print('Yes')
    else:
        print('No')
            
else:
    print('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 = map(int, input().split())

while A > 0 and C > 0:
    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')
        break
    a -= d
    if a <= 0:
        print('No')
        break

Solution (Python):
import sys
def main():
    A,B,C,D=tuple(map(int,sys.stdin.readline().split()))
    t=0
    while True:
        if t==0:
            if C<=B:break
            C-=B
        else:
            if A<=D:break
            A-=D
        t^=1
    print('Yes') if t==0 else print('No')
if __name__=='__main__':main()

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

Solution (Python):
th,ta ,ah , aa = map(int,input().split())

while th > 0 or ah >0:
  ah -= ta
  if th > 0:
    win = 'Yes'
  th -= aa
  if ah > 0:
    win = 'No'
print(win)

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):
import sys
from collections import deque
sys.setrecursionlimit(10**6)
def S(): return sys.stdin.readline().rstrip()
def SL(): return map(str,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def IL(): return map(int,sys.stdin.readline().rstrip().split())
def LS(): return list(sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))

def Main():
    a,b,c,d = IL()
    t = 1
    while 0<a and 0<c:
        if t%2:
            c -= b
        else:
            a -= d
        t += 1
    if a<c:
        print('No')
    else:
        print('Yes')
    return

if __name__=='__main__':
    Main()

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

i=0
while True:
  if a<=0 or c<=0: break
  if i%2!=0:
    a-=d
  else:
    c-=b
  i+=1
    
if a<=0:
  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())

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

if flg_t == 0:
    print('No')
else:
    print('Yes')

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):
l=list(map(int,input().split()))
T=[l[0],l[1]]
A=[l[2],l[3]]
bool = True
while(True):

	if(bool):
		A[0] -= T[1]
		bool = False
		if(A[0] <= 0):
			print("Yes")
			break
	else:
		T[0] -= A[1]
		bool = True	
		if(T[0] <= 0):
			print("No")
			break

Solution (Python):
from sys import stdin, stdout
a, b, c ,d = map(int, stdin.readline().strip().split())
from math import ceil
x = ceil(a/d)
y = ceil(c/b)

if x>=y:
    print('Yes')
else:
    print('No')

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

Solution (Python):
def main():
    a, b, c, d = map(int, input().split())
    turn = 0
    while (a > 0) and (c > 0):
        if turn % 2 == 0:
            c -= b
        else:
            a -= d
        turn += 1
    if a > 0:
        print('Yes')
    else:
        print('No')
    
if __name__ == '__main__':
    main()

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

for i in range(100):
    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())
ans = "Yes"
curA = A
curC = C
for i in range(max(A,C)):
  curC  = curC-B
  if(curC<=0):
    ans = "Yes"
    break
  curA = curA-D
  if(curA<=0):
    ans = "No"
    break
print(ans)

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

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

for _ in range(100):
    c -= b
    if c <= 0:
        print("Yes")
        exit()
    a -= d
    if a <= 0:
        print("No")
        exit()

Solution (Python):
t_tairyoku,t_attack,a_tairyoku,a_attack = list(map(int,input().split()))

flag = 0
i = 0

while flag == 0:
    if i%2 == 0:
        a_tairyoku -= t_attack
    else:
        t_tairyoku -= a_attack
    if a_tairyoku <= 0:
        print("Yes")
        exit()
    if t_tairyoku <= 0:
        print("No")
        exit()
    i += 1

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

Solution (Python):
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  

a,b,c,d = na()

while a > 0 and c > 0:
  a = a-d
  c = c-b
if c <= 0 and a <= 0:
  print("Yes")
elif c <= 0 and a > 0:
  print("Yes")
else:
  print("No")

Solution (Python):
import sys
from math import sqrt, gcd, ceil, log
from bisect import bisect
from collections import defaultdict
inp = sys.stdin.readline
read = lambda: list(map(int, inp().strip().split()))





def solve():
	a, b, c, d = map(int, input().split(" "))
	i = 0
	while a > 0 or c > 0:
		if i%2 == 0:
			c -= b
		else:
			a -= d
		i += 1
	print("YNeos"[i%2::2])



if __name__ == "__main__":
	solve()

Solution (Python):
a,b,c,d=map(int,input().split())
while a>0 and c>0:
  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())
while a>0 and b>0:
  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())
 
while True:
  if C - B <= 0:
    print('Yes')
    break
  else:
    C = C - B
  if A - D <= 0:
    print('No')
    break
  else:
    A = A - D

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

takahashi_turn=0
aoki_turn=0

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

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

if takahashi_turn>=aoki_turn:
    print("Yes")
else:
    print("No")

Solution (Python):


"""
    Author : thekushalghosh
    Team   : CodeDiggers
 
    I prefer Python language over the C++ language :p :D
        
    Visit my website : thekushalghosh.github.io
"""
import sys,math,cmath,time
start_time = time.time()



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


 
def main():
    global tt
    if not ONLINE_JUDGE:
        sys.stdin = open("input.txt","r")
        sys.stdout = open("output.txt","w")
    t = 1
    for tt in range(t):
        solve()
    if not ONLINE_JUDGE:
        print("Time Elapsed :",time.time() - start_time,"seconds")
        sys.stdout.close()
    

def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    return(input().strip())
def invr():
    return(map(int,input().split()))
 

def counter(a):
    q = [0] * max(a)
    for i in range(len(a)):
        q[a[i] - 1] = q[a[i] - 1] + 1
    return(q)
 
def string_counter(a):
    q = [0] * 26
    for i in range(len(a)):
        q[ord(a[i]) - 97] = q[ord(a[i]) - 97] + 1
    return(q)

def power_two(n):
    if n == 1:
        return(True)
    sttr = str(n)
    len_str = len(sttr)
    sttr = list(sttr)
    num = 0
    if (len_str == 1 and sttr[len_str - 1] == '1'): 
        return(False)
    while (len_str != 1 or sttr[len_str - 1] != '1'):
        if ((ord(sttr[len_str - 1]) - ord('0')) % 2 == 1):
            return(False)
        j = 0; 
        for i in range(len_str):  
            num = num * 10 + (ord(sttr[i]) - ord('0')); 
            if (num < 2): 
                if (i != 0):  
                    sttr[j] = '0'
                    j += 1
                continue
  
            sttr[j] = chr((num // 2) + ord('0'))
            j += 1; 
            num = (num) - (num // 2) * 2
        len_str = j
    return(True)

def getLeftmostBit(n): 
    m = 0
    while (n > 1) : 
        n = n >> 1
        m += 1
    return(m)
def getNextLeftmostBit(n, m) : 
    temp = 1 << m 
    while (n < temp) : 
        temp = temp >> 1
        m -= 1
    return m
def bitcounter(n) :
    m = getLeftmostBit(n) 
    return _countSetBits(n, m) 
def _countSetBits(n, m) :
    if (n == 0) : 
        return 0
    m = getNextLeftmostBit(n, m)
    if (n == (1 << (m + 1)) - 1) : 
        return ((m + 1) * (1 << m))
    n = n - (1 << m)
    return (n + 1) + bitcounter(n) + m * (1 << (m - 1)) 

def log_two(n): 
    return(math.log(n) / math.log(2))


        
ONLINE_JUDGE = __debug__
if ONLINE_JUDGE:
    input = sys.stdin.readline
    
main()

Solution (Python):
import math
def fact(n):
    ans = 1
    for i in range(2, n+1):
        ans*= i
    return ans
def comb(n, c):
    return fact(n)//(fact(n-c)*c)

a,b,c,d = map(int, input().split())
t = True
while(a >0 and b > 0):
    c-=b
    if(c <= 0):
        t = True
        break
    a-=d
    if(a  <= 0):
        t = False
        break
if(t):
    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
    else:
        None

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())
z = c//b
w = a//d
if c%b!=0:z+=1
if a%d!=0:w+=1
if z>w:print("No")
else:print("Yes")

Solution (Python):
a,b,c,d = map(int,input().split())
for i in range(200):
    if i%2==0:
        c-=b
        if c<=0:
            print("Yes")
            break
    else:
        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):

def main():
    t_hp, t_atk, a_hp, a_atk = map(int, input().split(' '))

    while True:
        a_hp -= t_atk
        t_hp -= a_atk
        if a_hp <= 0 and t_hp > 0:
            print('Yes')
            exit(0)
        elif t_hp <= 0 and a_hp > 0:
            print('No')
            exit(0)
        elif a_hp <= 0 and t_hp <= 0:
            print('Yes')
            exit(0)


if __name__ == "__main__":
    main()

Solution (Python):
A, B, C, D = list(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 = 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())
x = -(-a//d)
y = -(-c//b)
if x >= y:
    print('Yes')
else:
    print('No')

Solution (Python):
a, b, c, d = map(int, input().split())
if -(-c // b) <= -(-a // d):
    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):
tkhp, tkat, aohp, aoat = map(int, input().split())

while True:
    aohp -= tkat
    if aohp <= 0:
        print('Yes')
        break
    tkhp -= aoat
    if tkhp <= 0:
        print('No')
        break

Solution (Python):
a,b,c,d = map(int,input().split())
if c%b ==0:
  e = c//b
else:
  e = c//b +1

if a%d ==0:
  f = a//d
else:
  f = a//d +1

if e>f:
  print("No")
else:
  print("Yes")

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

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

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


if tkhs_attack > aok_attack:
    print('No')
else:
    print('Yes')

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

Solution (Python):
a,b,c,d = map(int, input().split())
flag = True
while flag:
    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())

takahashi = (a+d-1) // d
aoki = (c+b-1) // b

if takahashi >= aoki:
    print('Yes')
else:
    print('No')

Solution (Python):
TH,TA,AH,AA = map(int,input().split())
i = True

while i:
    AH -= TA
    if AH < 1:
        print('Yes')
        exit(0)
    
    TH -= AA
    if TH < 1:
        print('No')
        exit(0)

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())

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')
        break
    a -= d
    if a <= 0:
        print('No')
        break

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

t = -(-C // B)
a = -(-A // D)

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

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

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

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

Solution (Python):
def main():
    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

if __name__=="__main__":
    main()

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

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

Solution (Python):

A,B,C,D = map(int,input().split())
ans = ['No', 'Yes']
takahashi = (C-1)//B + 1
aoki = (A-1)//D + 1
print(ans[takahashi<=aoki])

Solution (Python):
a,b,c,d=[int(x) for x in input().split()]
while a>0 and c>0:
  c-=b
  if c<=0:
    print("Yes")
    break
  a-=d
else:
  print("No")

Solution (Python):
import math
A,B,C,D = map(int,input().split())
print("Yes" if math.ceil(C/B) <= math.ceil(A/D) else "No")

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

Solution (Python):
a, b, c, d = map(int, input().split())
tpow = a // d  + (0 if a % d == 0 else 1)
apow = c // b  + (0 if c % b == 0 else 1)

if tpow >= apow:
    print("Yes")
else:
    print("No")

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

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

import math

tkturn=math.ceil(c/b)
akturn=math.ceil(a/d)



if tkturn<=akturn:
  print('Yes')
else:
  print('No')

Solution (Python):
A,B,C,D = list(map(int,input().split()))
a=0
c=0
while A > 0:
  A -= D
  a += 1
while C > 0:
  C -= B
  c += 1
if a < c:
  print('No')
elif a >= c:
  print('Yes')

Solution (Python):
A, B, C, D = map(int,input().split())
player_1_turn = -(-C // B)
player_2_turn = -(-A // D)
print('Yes') if player_1_turn <= player_2_turn else print('No')

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

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

Solution (Python):
a,b,c,d=map(int,input().split())    
ta=(c-1)//b
ao=(a-1)//d

if ta<=ao:
    print("Yes")
else:
    print("No")

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

HP_T=A
HP_A=C

for i in range(1,1000):
    if i%2==1:
        HP_A -= B
    else:
        HP_T -= D

    if HP_A<=0:
        print('Yes')
        exit()
    elif HP_T<=0:
        print('No')
        exit()
    else:
        pass

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

k = math.ceil(a/d)
t = math.ceil(c/b)
if (t <= k):
    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 = (int(x) for x in input().split())
while (A>0) and (C>0):
    C = C-B
    if C<=0:
        Flag = True
        break
    A = A-D
    if A<=0:
        Flag = False
        break

if Flag:
    print('Yes')
else:
    print('No')

Solution (Python):
def solve():
    A, B, C, D = map(int, input().split())
    print('YNeos'[-(-C//B) > -(-A//D)::2])


if __name__ == '__main__':
    solve()

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

while True:
  cnt1 += 1
  c -= b
  if c <= 0:
    break

while True:
  cnt2 += 1
  a -= d
  if a <= 0:
    break
  
if cnt2 < cnt1:
  print("No")
else:
  print("Yes")

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())
flg = True
for i in range(2 * max(A, C) + 1):
    if i % 2 == 0:
        C -= B
        if C <= 0:
            flg = False
            print('Yes')
    else:
        A -= D
        if A <= 0:
            flg = False
            print('No')
    if not flg:
        break

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

Solution (Python):
A,B,C,D = list(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):
    if(c<=0):
        print("Yes")
        break
    elif(a<=0):
        print("No")
        break
    else:
        c-=b
        a-=d

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

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

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

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

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

if math.ceil(A/D) >= math.ceil(C/B):
    print('Yes')
else:
    print('No')

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

flag = 0
turn = 0
while True:
  if turn == 0:
    c -= b
  else:
    a -= d

  if a <= 0:
    break
  if c <= 0:
    flag = 1
    break
  
  turn = turn ^ 1

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

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

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

Solution (Python):
hp_a,at_a, hp_b, at_b = list(map(int, input().split()))
while True:
  hp_b = hp_b - at_a
  if hp_b <= 0:
    print("Yes")
    exit()
  hp_a = hp_a - at_b
  if hp_a <= 0:
    print("No")
    exit()

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

flag_T=False
flag_A=False

while flag_T==False and flag_A==False:
  C=C-B
  if C<=0:
    flag_T=True
  A=A-D
  if A<=0:
    flag_A=True
  
if flag_T==True:
  print('Yes')
else:
  print('No')

Solution (Python):
A,B,C,D = list(map(int,input().split(" ")))
S,T = [0,0]

if A%D != 0:
  S +=1
if C%B != 0:
  T += 1
if C//B + T <= A//D + S:
  print("Yes")
else:
  print("No")

Solution (Python):


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

result = 0
while True:
    c -= b
    if c <= 0:
        result = 1
        break
    a -= d
    if a <= 0:
        break

if result == 1:
    print('Yes')
else:
    print('No')

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

ans = ""
while ans == "":
    c -= b
    if c <= 0:
        ans = "Yes"
        continue

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

print(ans)

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

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

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

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

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

Solution (Python):
import sys

A, B, C, D = [int(x) for x in 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 = C - B
    if C <= 0:
        print('Yes')
        exit()
    A = A - D
    if A <= 0:
        print('No')
        exit()

Solution (Python):
def actual(a, b, c, d):
    hp_takahashi, atk_tahashi = a, b
    hp_aoki, atk_aoki = c, d

    while True:
        hp_aoki -= atk_tahashi

        if hp_aoki <= 0:
            return 'Yes'

        hp_takahashi -= atk_aoki

        if hp_takahashi <= 0:
            return 'No'

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

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

t_hp = a
a_hp = c
while a_hp > 0 or t_hp > 0:
    a_hp -= b
    t_hp -= d
    if a_hp <= 0:
         print("Yes")
         exit()
    elif t_hp <= 0:
         print("No")
         exit()

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


print("Yes" if -(-a//d) >= -(-c//b) else "No")

Solution (Python):
a,b,c,d=map(int,input().split())
now=0
while True:
    if a<=0 or c<=0:
        break
    else:
        if now%2==0:
            c-=b
            now+=1
        else:
            a-=d
            now+=1
print('Yes' if a>0 else 'No')

Solution (Python):
a,b,c,d=map(int,input().split())
def cc(at,hp):
  d=0
  while hp-at>0:
    hp-=at
    d+=1
  return d


if cc(b,c)>cc(d,a):print('No')
else:print('Yes')

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

"""

"""

from math import ceil

a, b, c, d = map(int, input().split())
if ceil(c/b) <= ceil(a/d):
    print("Yes")
else:
    print("No")