#include <bits/stdc++.h>

using namespace std;

int main() {
    static int a[500][500];
    int n = 500, m = 500;
    // cin >> n >> m;
    for (int i = 0; i < n; ++i) 
        for (int j = 0; j < m; ++j)
            // cin >> a[i][j];
            a[i][j] = 1;
            
    const int INF = (int)2e9;
    int ans = -INF; // INF = 2e9
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            for (int side = 1; side <= min(min(i + 1, j + 1), min(n - i, m - j)); ++side) {
                int s = 0;
            
                for (int k = i - (side - 1); k <= i + (side - 1); k++)
                    for (int l = j - (side - 1); l <= j + (side - 1); l++)
                        if (ceil(hypot(i - k, j - l)) < side)
                            s += a[k][l];
            
                ans = max(ans, s);
            }
                        
    cout << ans << endl;
}