insidcode
ProblemsDuelLeaderboardStats
Sign In
  1. Home
  2. Problems
  3. Prime Checker

Prime Checker

Difficulty: Easy

Phase: 2 · Looping and Patterns

XP Reward: 10 XP

Topics: Looping and Patterns, Easy

Supported Languages: Python, JavaScript, C, C++, Java

Problem Description

Given integer N (> 1), print 'Prime' or 'Not Prime'. Input Format: Read input from standard input (stdin). Output Format: Print the result to standard output (stdout).

Constraints

  • -10^9 <= N <= 10^9

Examples

Example 1

Input: 17

Output: Prime

Explanation: Sample execution for input 17