// evaluate a lagrange interpolant at  many points

#include <iostream>
#include <vector>
#include <cmath>
using namespace std;

double f( double x ); // function to be interpolated

double bf( double x, int i, vector<double> y ); // lagrange basis function

double f( double x )
{ return 1.0/(1+25*x*x);}

double bf( double x, int i, vector<double> y )
{ // lagrange basis function
  int n = y.size(), j;
  double v = 1;
  for( j=0; j<i; j++ )
    v *= (x-y[j])/(y[i]-y[j]);
  for( j=i+1; j<n; j++ )
    v *= (x-y[j])/(y[i]-y[j]);
  return v;
}


 int main()
{
  int n,i,j;
  int numout = 201;

  // read poly degree
  cin >> n;

  vector<double> y(n+1);
  double x, dx = 2.0/(numout-1), h =2.0/n, val;
  double pi = 4*atan(1.0);
  double ph = pi/n;

  // generate the n+1 interpolation points
  for(i=0; i<=n; i++ )
     y[i] = -1.0 + i*h;

  for( j=0, x=-1.0; j<numout; x+=dx, j++){
    // evaluate interpolant at x -- can be done more efficiently
    for( i=0,val=0.0; i<=n; i++ )
      val += f(y[i])*bf(x,i,y);
    cout << x << ' ' << f(x) << ' ' << val << ' ' << f(x) - val << endl;
  }


  return 0;
}