module Main where
-- solve :: Int ->
solve = primes
primes n = go n 2
go x i | i * i > x = [x]
| x `
mod` i
== 0 = i : go
(x `
div` i
) i
bW9kdWxlIE1haW4gd2hlcmUKCm1haW4gOjogSU8gKCkKbWFpbiA9IHJlYWRMbiA+Pj0gcHJpbnQgLiBzb2x2ZQoKLS0gc29sdmUgOjogSW50IC0+IApzb2x2ZSA9IHByaW1lcwoKcHJpbWVzIDo6IEludCAtPiBbSW50XQpwcmltZXMgbiA9IGdvIG4gMgoKZ28gOjogSW50IC0+IEludCAtPiBbSW50XQpnbyB4IGkgfCBpICogaSA+IHggPSBbeF0KICAgICAgIHwgeCBgbW9kYCBpID09IDAgPSBpIDogZ28gKHggYGRpdmAgaSkgaQogICAgICAgfCBvdGhlcndpc2UgPSBnbyB4ICQgc3VjYyBp