To make a paper airplane, one has to use a rectangular piece of paper. From a sheet of standard size you can make $s$ airplanes.

A group of $k$ people decided to make $n$ airplanes each. They are going to buy several packs of paper, each of them containing $p$ sheets, and then distribute the sheets between the people. Each person should have enough sheets to make $n$ airplanes. How many packs should they buy?


-----Input-----

The only line contains four integers $k$, $n$, $s$, $p$ ($1 \le k, n, s, p \le 10^4$) — the number of people, the number of airplanes each should make, the number of airplanes that can be made using one sheet and the number of sheets in one pack, respectively.


-----Output-----

Print a single integer — the minimum number of packs they should buy.


-----Examples-----
Input
5 3 2 3

Output
4

Input
5 3 100 1

Output
5



-----Note-----

In the first sample they have to buy $4$ packs of paper: there will be $12$ sheets in total, and giving $2$ sheets to each person is enough to suit everyone's needs.

In the second sample they have to buy a pack for each person as they can't share sheets.

Difficulty: interview

Starter code:

Solutions:
k, n, s, p = list(map(int, input().split()))

x = (n + s - 1) // s
y = k * x
z = (y + p - 1) // p

print(z)


k, n, s, p = map(int, input().split())
print(((n + s - 1) // s * k + p - 1) // p)

k, n, s, p = map(int, input().split())
person = (n - 1) // s + 1
al = person * k
pack = (al - 1) // p + 1
print(pack)

k, n, s, p = map(int, input().split())
x = (n + s - 1) // s
print((x * k + p -1) // p)

k, n, s, p  = list(map(int, input().split()))
sheets_per_person = (n+s-1)//s
sheets = sheets_per_person*k
print((sheets+p-1)//p)


from math import ceil

k, n, s, p = [int(i) for i in input().split()]
print(ceil(ceil(n / s) * k / p))

from math import ceil
k, n, s, p = list(map(int, input().split()))
p_per_person = ceil(n / s)
n_s = k * p_per_person
ans = ceil(n_s/p)
print(ans)

def inp():
    return list(map(int, input().split()))
def li():
    return list(inp())
k, n, s, p = inp()
print((k * ((n + s - 1) // s) + p - 1) // p)


k, n, s, p = list(map(int, input().split()))

one = (n + s - 1) // s
print((one * k + p - 1) // p)


k,n,s,p = map(int,input().split())
q = n//s
if (n%s):
    q+=1
q *= k
w = q // p
if (q%p):
    w+=1
print(w)

#!/usr/bin/env python3

[k, n, s, p] = list(map(int, input().strip().split()))

def ceil(a, b):
	return -((-a) // b)

print(ceil(k * ceil(n, s), p))


k,n,s,p = map(int,input().split())
t = n // s + bool(n % s)
print(k * t // p + bool(k * t % p))

import math

k, n, s, p = list(map(int, input().split()))

print(math.ceil((k * math.ceil(n / s)) / p))


import math
k,n,s,p=list(map(int,input().split()))
print(int(math.ceil(k*math.ceil(n/s) /p)    ))


import math
k,n,s,p=map(int,input().split(' '))
ans=math.ceil(k*(math.ceil(n/s))/p)
print(ans)

from math import ceil

k, n, s, p = list(map(int, input().split()))

print(ceil(k * ceil(n / s) / p))


from math import ceil
k,n,s,p=[int(i)for i in input().split()]
x = ceil(n/s)
print(ceil((x * k)/p))

k, n, s, p = [int(x) for x in input().split()]

lists = n // s + (0 if n % s == 0 else 1)

needed = k * lists

print(needed // p + (0 if needed % p == 0 else 1))

import sys
import math

k, n, s, p = list(map(int,sys.stdin.readline().strip().split(' ')))
#int(sys.stdin.readline().strip())
#arr = list(map(int,sys.stdin.readline().strip().split(' ')))

print(math.ceil((k * math.ceil(n/s))/p))

import math


k, n, s, p = [int(x) for x in input().strip().split(" ")]

nospp = math.ceil(n/s)
ts = k*nospp
print(math.ceil(ts/p))

from math import ceil

k, n, s, p = map(int, input().split())

l = ceil(n / s)

t = int(ceil(k * l/p))

print(t)

k, n, s, p = (int(i) for i in input().split())

L = k * (n // s + int(bool(n % s)))

print(L // p + int(bool(L % p)))


from math import ceil

k, n, s, p = map(int, input().split())

print(ceil((ceil(n/s) * k) / p))

from sys import stdin, stdout
from math import factorial
from math import log10


k, n, s, p = map(int, stdin.readline().split())

l, r = 0, 10 ** 9
while r - l > 1:
    m = (l + r) >> 1
    v = (m * p) // k
    
    
    if v * s >= n:
        r = m
    else:
        l = m
    

stdout.write(str(r))

import math

k, n, s, p = [int(x) for x in input().split()]

print( int(math.ceil(math.ceil(n/s) * k/p) ))