#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include <math.h>
#include <map>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <algorithm>
#include <array>
#include <unordered_set>
#include <unordered_map>
#include <string>
using namespace std;

bool rcmp(int a, int b) { return a>b; }
typedef long long LL;



int main() {
    int n, i, a, b;
    LL xa, xb, xc, xx, r, x1, x2;
    double xq;
    scanf("%d", &n);
    r=0;
    for (a=0; a<10; a++) for (b=0; b<10; b++) if (a!=b) {
        xa=1;
        xb=-n*a;
        xc=-(b*n+1);
        xx = xb*xb-4*xa*xc;
        if (xx<0) continue;
        xq = sqrt(xx);
        x1=(-xb-xq)/2; x1-=2;
        while(x1*x1+xb*x1+xc>=0) x1++;
        if (x1<=a) x1=a+1; if (x1<=b) x1=b+1;
        x2=(-xb+xq)/2; x2+=2;
        while(x2*x2+xb*x2+xc>=0) x2--;
        if (x2>=x1) r+=(x2-x1+1);
    }
    printf("%lld\n", r);
    return 0;
}