PROGRAMMING:Stone game
Two smart enough people play the game of taking stones in turn. The one who gets the last stone wins. They can only take one, three, seven or eight stones at a time. They write a program to judge whether the person who takes the first stone loses or wins.
###Input format:
An integer n whose value does not exceed 10000000.
###Output format:
If the winner wins, output 1 in a single line, otherwise output 0.
###Input example:
Here are three sets of inputs.
```in
one
```
```in
ten
```
```in
three hundred
```
###Output example:
The corresponding outputs of the above three groups of data are as follows:
```out
one
```
```out
one
```
```out
0
```
answer：If there is no answer, please comment
###Input format:
An integer n whose value does not exceed 10000000.
###Output format:
If the winner wins, output 1 in a single line, otherwise output 0.
###Input example:
Here are three sets of inputs.
```in
one
```
```in
ten
```
```in
three hundred
```
###Output example:
The corresponding outputs of the above three groups of data are as follows:
```out
one
```
```out
one
```
```out
0
```
answer：If there is no answer, please comment