#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <bitset>

using namespace std;


typedef long long ll;


int main()
{
    vector<vector<int>> a(1000, vector<int>(1000, 0));
    int x = 500;
    int y = 500;
    int n = 5;
    int k = 5;
    for(int z = 0; z < 5; ++z){
        a[x][y] = 1;
        for(int i = 0; i < n; ++i){
            --x;
            a[x][y] = 1;
        }
        for(int i = 0; i < n; ++i){
            y++;
            a[x][y] = 1;
        }
        n += k;
        for(int i = 0; i < n; ++i){
            ++x;
            a[x][y] = 1;
        }
        for(int i = 0; i < n; ++i){
            y--;
            a[x][y] = 1;
        }
        n += k;
    }
    x = 511;
    y = 511;
    int res = 0;
    int counter = 0;
    for(int k = 1; k <= 10; ++k){
        int ans = 0;
        n = k;
        for(int z = 0; z < 5; ++z){
            if(a[x][y] == 1)
                ++ans;
            for(int i = 0; i < n; ++i){
                x--;
                if(a[x][y] == 1)
                    ++ans;
            }
            for(int i = 0; i < n; ++i){
                y++;
                if(a[x][y] == 1)
                    ++ans;
            }
            n += k;
            for(int i = 0; i < n; ++i){
                x++;
                if(a[x][y] == 1)
                    ++ans;
            }
            for(int i = 0; i < n; ++i){
                y--;
                if(a[x][y] == 1)
                    ++ans;
            }
            n += k;
        }
        if(ans > counter){
            counter = ans;
            res = k;
        }
    }
    cout << res << endl;
}