#include<bits/stdc++.h>
#define EPS 1e-8
void solve()
{
	int n = 20;
	int m = 21;
	std::map<std::pair<double, double>, int> mp;
	std::map<std::array<double, 4>, int> vis;
    int ans = n + m;
    std::vector<std::pair<double, double>> res;
	for(double x1 = 0; x1 < n; x1++)
	{
		for(double y1 = 0; y1 < m; y1++)
		{
			for(double x2 = 0; x2 < n; x2++)
			{
				for(double y2 = 0; y2 < m; y2++)
				{
					if(x1 != x2 && y1 != y2) 
                    {
                        double k = 1.0 * (y1 - y2) / (x1 - x2);
                        double b = y1 - x1 * k;
                        if(mp[{k, b}] == 0)
                        {
                            mp[{k, b}] = 1;
                            res.push_back({k, b});
                            ans++;
                        }
                    }
				}
			}
		}
	}
	std::sort(res.begin(), res.end());
	
	for(int i = 0; i < res.size() - 1; i++)
	{
		if(fabs(res[i].first - res[i +1].first) < EPS && fabs(res[i].second - res[i + 1].second) < EPS)
		{
			ans--;
		}
	}
	
	std::cout << ans << "\n";
}
signed main()
{
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);
	int t = 1;
	while(t--) solve();
	return 0;
}