Prime Firewall

Aziz and Jasur are upgrading their office network security system. The new authentication protocol requires every server access token to be a prime number to block unauthorized connections effectively.

If a generated token $N$ happens to be composite, the system automatically rounds it up to the smallest prime number greater than or equal to $N$. Given the initial token value $N$, help Aziz and Jasur write a script to find the secure prime token.