import Control.Applicative ((<$>))
import qualified Data.ByteString.Char8 as C
import Data.List (sortBy)
import Data.Maybe (fromJust)

type Spot k v = (k, v, v)

compareSpots :: (Num v, Ord v) => Spot k v -> Spot k v -> Ordering
compareSpots (_, t1, d1) (_, t2, d2) = compare (t2 * d1) $ t1 * d2

optimizeSeq :: (Num k, Num v, Ord v) => [Spot k v] -> [k]
optimizeSeq = fmap f . sortBy compareSpots
    where f (i, _, _) = i

unsafeReadInt :: C.ByteString -> Int
unsafeReadInt = fst . fromJust . C.readInt

main :: IO ()
main = do
    n <- unsafeReadInt <$> C.getLine
    ts <- fmap unsafeReadInt . C.words <$> C.getLine
    ds <- fmap unsafeReadInt . C.words <$> C.getLine
    let ss = optimizeSeq $ zipWith3 g [1 .. n] ts ds
    putStrLn . unwords $ fmap show ss
    where
        g i t s = (i, t, s)