BETA
This is a school problem. Successful submissions of this are not counted in user ratings.

Submissions : 1058 Accuracy :

30.06

Tidy Number
     

Given a number, the task is to check if it is tidy or not. A tidy number is a number whose digits are in non-decreasing order.

Examples:

Input : 1234
Output : Yes

Input : 1243
Output : No
Digits "4" and "3" violate the property.


Input:
The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. Each test case contains an integer N.

Output:
For each test case in a new line print 1 if the no is a tidy number else print 0.

Constraints:
1<=T<=100
1<=N<=10^9+7

Example:
Input:

2
1234
1243
Output:
1
0

**For More Examples Use Expected Output**


Set Default Code

					   
Result:
It is recommended to test your code before clicking 'Submit' button!



                   



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