BETA

Difficulty Level:

Easy

Total Submissions: 26 Accuracy:

11.54%

Range of Composite numbers (Function Problem)
       

Given an integer n, we need to find a range of positive integers such that all the number in that range are composite and length of that range is n. You may return anyone range in the case of more than one answer.

Input:
First line consists of T test cases. Only line, consists of an Integer N.

Output:
Single line output, "1" if range found else "0".

Constraints:
1<=T<=100
1<=N<=100

Example:
Input:
2
3
5
Output:
1
1

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Saksham Raj Seth


					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.