Prime Number or Not using sqrt.cpp

///Prime Number or Not using sqrt

/**
*
*   author :: 101rror
*
**/

#include <bits/stdc++.h>

using namespace std;

#define MAX 100
#define infinity 1000000000000000LL
#define all(x) (x).begin(),(x).end()
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define mod(x,m) ((x%m)+m)%m;                               //101rror
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL))

#define T while(t--)
#define for2(i,a,b) for(i=a;i>=b;i--)
#define for3(i,a,b) for(i=a;i<=b;i=i+2)
#define for1(i,a,b) for(i=a;i<=b;i=i+1)
#define for4(i,a,b) for(i=a;i>=b;i=i-2)

#define fi first
#define se second
#define pb push_back
#define eb emplace_back

#ifdef LOCAL
#include "algo/debug.h"
#else
#define debug(...) 42
#endif


int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    fastread();

    int num, count = 0;
    cin >> num;

    for(int i = 2; i <= sqrt(num); i++)
    {
        if(num % i == 0)
        {
            count++;
        }
    }

    if(count == 0)
    {
        cout << endl;
        cout << num << " is Prime Number.";
        cout << endl;
    }

    else
    {
        cout << endl;
        cout << num << " is not Prime Number.";
        cout << endl;
    }

    return 0;
}