**Strong Numbers **are the numbers whose sum of factorial of digits is equal to the original number. Given a number, the task is to check if it is a Strong Number or not.

Examples:

```
Input : n = 145
Output : 1
Sum of digit factorials = 1! + 4! + 5!
= 1 + 24 + 120
= 145
Input : n = 5314
Output : 0
```

**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 number is a strong number, else print a 0.

**Constraints:**

1<=T<=200

1<=N<=10000

**Example:
Input:**

2

145

100

1

0

All Is Well | 176 |

Srinivas Chakravarth | 142 |

ioan | 131 |

praveen2809 | 116 |

Diplav Srivastava | 105 |

Lam Ngoc Pham | 405 |

All Is Well | 365 |

Divvya Sinha | 356 |

skull tone | 310 |

Prateek Gole | 309 |

akhayrutdinov | 3805 |

sanjay05 | 3366 |

Michael Riegger | 2014 |

Jasleen Kaur 2 | 2012 |

Quandray | 1933 |