Problem: Furik loves painting stars. A star is a shape that results if we take a regular pentagon and paint all diagonals in it. 

<image>

Recently he decided to teach Rubik to paint stars. After many years of training Rubik could paint stars easily. But now Furik decided to test Rubik and complicated the task. Rubik must paint n stars, observing the following rules:

  * all stars must be painted in a single move (i.e. it is forbidden to take the pen away from the paper); 
  * it is forbidden to paint the same segment of non-zero length more than once; 
  * the stars can intersect only in their vertexes; 
  * the length of a side of the regular pentagon, in which Rubik paints each star, must equal 10. 



Help Rubik to cope with this hard task.

Input

A single line contains an integer (1 ≤ n ≤ 100) — the number of stars to paint.

Output

On the first line print an integer m (1 ≤ m ≤ 5·n). On the next m lines print coordinates of m distinct points with accuracy of at least 9 and at most 100 digits after decimal point. All coordinates should not exceed 5000 in their absolute value. On each of the next n lines print 5 integers — the indexes of the points that form the given star in the clockwise or counterclockwise order. On the next line print 5·n + 1 integers — the numbers of points in the order, in which Rubik paints stars. That is, if number with index i is ai, and number with index i + 1 is ai + 1, then points with indexes ai and ai + 1 will have a segment painted between them. 

You can consider all m printed points indexed from 1 to m in the order, in which they occur in the output. Separate the numbers on the lines with whitespaces.

Note that the answer has an imprecise validation. Try to obtain as accurate a solution as possible. The validator performs all calculations considering that the absolute error of a participant's answer is not more than 10 - 8.

Examples

Input

1


Output

5
3.830127018922193 3.366025403784439
-3.601321235851749 10.057331467373021
0.466045194906253 19.192786043799030
10.411264148588986 18.147501411122495
12.490381056766580 8.366025403784439
1 2 3 4 5
1 3 5 2 4 1

Note

The initial position of points in the sample is:

<image>

The order in which Rubik can paint segments is:

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T abs(T a) {
  return a < 0 ? -a : a;
}
template <typename T>
T sqr(T a) {
  return a * a;
}
const int INF = (int)1e9;
const long double EPS = 1e-9;
const long double PI = 3.1415926535897932384626433832795;
const int N = 1000;
pair<long double, long double> operator-(
    const pair<long double, long double>& a,
    const pair<long double, long double>& b) {
  return pair<long double, long double>(a.first - b.first, a.second - b.second);
}
pair<long double, long double> operator+(
    const pair<long double, long double>& a,
    const pair<long double, long double>& b) {
  return pair<long double, long double>(a.first + b.first, a.second + b.second);
}
inline pair<long double, long double> rotate(
    const pair<long double, long double>& a, const long double& ang) {
  return pair<long double, long double>(
      a.first * cos(ang) - a.second * sin(ang),
      a.first * sin(ang) + a.second * cos(ang));
}
int m;
int n;
pair<long double, long double> p[N];
vector<int> g[N];
vector<int> pol[N];
const long double ROT_ANG = 2 * PI / 5;
void draw(int cnt, int s1, int s2) {
  int cp[10];
  cp[0] = s1;
  cp[1] = s2;
  pair<long double, long double> v = p[s2] - p[s1];
  int prev = s2;
  for (int i = 0; i < int(3); ++i) {
    v = rotate(v, ROT_ANG);
    p[n] = p[prev] + v;
    cp[2 + i] = n;
    prev = n;
    n++;
  }
  v = rotate(v, ROT_ANG);
  pair<long double, long double> u = p[n - 1] + v;
  if (abs(p[s1].first - u.first) > 1e-1 || abs(p[s1].second - u.second) > 1e-1)
    throw;
  for (int i = 0; i < int(5); ++i) {
    int i1 = (i + 1) % 5;
    int i2 = (i + 4) % 5;
    for (int j = 0; j < int(5); ++j) {
      if (j != i1 && j != i && j != i2) g[cp[i]].push_back(cp[j]);
    }
  }
  for (int i = 0; i < int(5); ++i) pol[m - cnt].push_back(cp[i]);
  if (cnt > 1) {
    int i1 = 0;
    for (int i = 1; i < 5; ++i)
      if (p[cp[i1]] < p[cp[i]]) i1 = i;
    int i2 = i1 + 1;
    if (i2 == 5) i2 = 0;
    draw(cnt - 1, cp[i2], cp[i1]);
  }
}
set<pair<long double, long double> > visited;
vector<int> ans;
void fleury(int v) {
  while (!g[v].empty()) {
    int u = g[v].back();
    g[v].pop_back();
    if (visited.count(pair<long double, long double>(min(v, u), max(v, u))))
      continue;
    visited.insert(pair<long double, long double>(min(v, u), max(v, u)));
    fleury(u);
    ans.push_back(u);
  }
}
int main() {
  cin >> m;
  p[0] = pair<long double, long double>(0, 0);
  p[1] = pair<long double, long double>(10, 0);
  n = 2;
  draw(m, 0, 1);
  long double minY = 1e100, minX = 1e100;
  for (int i = 0; i < int(n); ++i) {
    minY = min(minY, p[i].second);
    minX = min(minX, p[i].first);
  }
  for (int i = 0; i < int(n); ++i) {
    p[i].first -= minX + 4999;
    p[i].second -= minY + 4999;
  }
  cout << n << endl;
  for (int i = 0; i < int(n); ++i) {
    printf("%0.10lf %0.10lf\n", (double)p[i].first, (double)p[i].second);
  }
  for (int i = 0; i < int(m); ++i) {
    for (int j = 0; j < int(5); ++j) {
      if (j != 0) printf(" ");
      printf("%d", pol[i][j] + 1);
    }
    puts("");
  }
  fleury(0);
  ans.push_back(0);
  for (int i = 0; i < int(int((ans).size())); ++i) {
    if (i != 0) printf(" ");
    printf("%d", ans[i] + 1);
  }
  puts("");
  return 0;
}