#include <iostream>
#include <cmath>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define int double
const int N = 10000000;
#define x first
#define y second
typedef pair<double, double> pii;
// map<pii, int> mp;
bool cmp;
map<pii, int> mp;
signed main()
{
int m = 0;
int ans = 20 + 21; // 横着的直线,竖着的直线;
for (int x1 = 0; x1 < 20; x1++)
{
for (int y1 = 0; y1 < 21; y1++)
{
for (int x2 = 0; x2 < 20; x2++)
{
for (int y2 = 0; y2 < 21; y2++)
{
if (x1 == x2 || y1 == y2)
{
continue;
}
double k = (y2 - y1) / (x2 - x1);
double b = (y2 * x1 - y1 * x2) / (x2 - x1);
pii now = {k, b};
if (!mp.count(now))
{
ans++;
}
mp[now] = 1;
}
}
}
}
cout << ans;
return 0;
}