SGU 107

107. 987654321 problem

time limit per test: 0.25 sec.
memory limit per test: 4096 KB

For given number N you must output amount of N-digit numbers, such, that last digits of their square is equal to 987654321.

Input

Input contains integer number N (1<=N<=10⁶)

Output

Write answer to the output.

Sample Input

8

Sample Output

0


打表可知当n == 9时有八个解，大于9的解由乘法原理易算

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

int n;
int main()
{

    scanf("%d",&n);

    if( n <= 8 ) {
            printf("0
");

    } else if(n == 9) {
            printf("8
");
    } else {
            printf("72");
            for(int i = 10; i < n; i++) {
                    printf("0
");
            }
    }
    return 0;
}