#include<bits/stdc++.h>

 using namespace std;

 int sqr(int n, int m)

 {

     return m * m + n * n;

 }

 int main()

 {

     int n;

     int cnt = ;

     while(cin >> n)

     {

         if(cnt++) cout << endl;

         double r = (n - 0.5) *(n - 0.5);

         int in = ;

         int side = ;

         for(int i = ;i < n;i++)

         {

             for(int j = ;j < n;j++)

             {

                 if(sqr(i , j) < r && sqr(i + , j + ) < r ) in ++;

                 else if(sqr(i , j) < r && sqr(i + , j + ) > r) side++;

             }

         }

         printf("In the case n = %d, %d cells contain segments of the circle.\n",n,side*);

         printf("There are %d cells completely contained in the circle.\n",in*);

     }

     return ;

 }