using System;
using System.Collections;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Text;
using static System.Console;
using static System.Convert;
using static System.Math;
using static Extentions;

class IO
{
    int idx;
    string[] input;

    public IO(TextReader reader)
    {
        input = reader.ReadToEnd().Split(new[] { " ", "\n", "\r" },
            StringSplitOptions.RemoveEmptyEntries);
    }

    T Get<T>(Func<string, T> parser) => parser(input[idx++]);

    public string S => Get(s => s);
    public char C => Get(char.Parse);
    public int I => Get(int.Parse);
    public long L => Get(long.Parse);
    public double F => Get(double.Parse);
    public decimal D => Get(decimal.Parse);
    public BigInteger B => Get(BigInteger.Parse);

    T[] Gets<T>(int n, Func<string, T> parser)
        => input.Skip((idx += n) - n).Take(n).Select(parser).ToArray();

    public string[] Ss(int n) => Gets(n, s => s);
    public char[] Cs(int n) => Gets(n, char.Parse);
    public int[] Is(int n) => Gets(n, int.Parse);
    public long[] Ls(int n) => Gets(n, long.Parse);
    public double[] Fs(int n) => Gets(n, double.Parse);
    public decimal[] Ds(int n) => Gets(n, decimal.Parse);
    public BigInteger[] Bs(int n) => Gets(n, BigInteger.Parse);

    public void Write<T>(params T[] xs) => WriteLine(string.Join(" ", xs));
    public void Write(params object[] xs) => WriteLine(string.Join(" ", xs));
}

static class Extentions
{
    public static int[] Primes(int n)
    {
        if (n < 2) return Array.Empty<int>();

        var flgs = new bool[n + 1];
        for (var i = 3; i * i < n; i += 2)
            if (!flgs[i]) for (var j = i * i; j <= n; j += i) flgs[j] = true;

        var list = new List<int>() { 2 };
        for (var i = 3; i <= n; i += 2) if (!flgs[i]) list.Add(i);
        return list.ToArray();
    }

    public static long[] Factors(long x)
    {
        var list = new List<long>();
        foreach (var p in Primes((int)Sqrt(x)))
        {
            while (true)
            {
                long r; var q = DivRem(x, p, out r);
                if (r > 0) break;
                list.Add(p); x = q;
            }
        }
        if (x > 1) list.Add(x);
        return list.ToArray();
    }
}

static class Program
{
    public static void Main()
    {
        var sw = new StreamWriter(OpenStandardOutput()) { NewLine = "\n" };
#if DEBUG
        sw.AutoFlush = true;
#else
        sw.AutoFlush = false;
#endif
        SetOut(sw);
        Solve(new IO(In));
        Out.Flush();
    }

    static void Solve(IO io)
    {
        var n = io.L;

        if (Factors(n).Count() <= 2) io.Write("NO");
        else io.Write("YES");
    }
}