module Main where
solve n | isnotPrime n = "YES"
isnotPrime
= (>=3) . length . primes
primes n = go n 2
go x i | i * i > x = [x]
| x `
mod` i
== 0 = i : go
(x `
div` i
) i
bW9kdWxlIE1haW4gd2hlcmUKCm1haW4gOjogSU8gKCkKbWFpbiA9IHJlYWRMbiA+Pj0gcHJpbnQgLiBzb2x2ZQoKc29sdmUgOjogSW50IC0+IFN0cmluZwpzb2x2ZSBuIHwgaXNub3RQcmltZSBuID0gIllFUyIKICAgICAgICB8IG90aGVyd2lzZSAgICA9ICJOTyIKCmlzbm90UHJpbWUgOjogSW50IC0+IEJvb2wKaXNub3RQcmltZSA9ICg+PTMpIC4gbGVuZ3RoIC4gcHJpbWVzCgpwcmltZXMgOjogSW50IC0+IFtJbnRdCnByaW1lcyBuID0gZ28gbiAyCgpnbyA6OiBJbnQgLT4gSW50IC0+IFtJbnRdCmdvIHggaSB8IGkgKiBpID4geCA9IFt4XQogICAgICAgfCB4IGBtb2RgIGkgPT0gMCA9IGkgOiBnbyAoeCBgZGl2YCBpKSBpCiAgICAgICB8IG90aGVyd2lzZSA9IGdvIHggJCBzdWNjIGk=