Divisible by 8
Submissions: 5590   Accuracy:

28.62%

  Difficulty: Medium   Marks: 4
Associated Course(s):   Sudo Placement 2019

Given a number, you need to check whether any permutation of the number is divisible by 8 or not. Print Yes or No.

Input:
The first line of input contains a single integer T denoting the number of test cases. Then T test cases follow. Each test case consist of one line. The first line of each test case consists of an integer N.

Output:
Corresponding to each test case, in a new line, print Yes if divisible by 8, else No.

Constraints:
1 ≤ T ≤ 100
1 ≤ N ≤ 100000

Example:

Input
2
46
345

Output
Yes

No

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

Author: rajatjha


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



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


to report an issue on this page.