#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <queue>

//#define DEBUG

#ifdef DEBUG
#define PRINT(x) std::cout << x;
#else
#define PRINT(x)
#endif

#define MAX_SQUARES_COUNT 15

// Brand-new struct
struct Square {
  int8_t x, y;
  int8_t size;
};

class State {
 public:
  explicit State(int8_t length)
      : scheme_(new bool*[length]), length_side_(length) {
    for (int8_t i = 0; i < length; ++i) {
      // `{}` --- calling default ctor
      scheme_[i] = new bool[length]{};
    }
    squares_ = new Square[MAX_SQUARES_COUNT]{};
    SetStartSquares();
  }

  State(const State& object)
      : scheme_(new bool*[object.length_side_]),
        squares_count_(object.squares_count_),
        length_side_(object.length_side_),
        squares_(new Square[MAX_SQUARES_COUNT]) {
    for (int8_t i = 0; i < object.length_side_; ++i) {
      scheme_[i] = new bool[object.length_side_];
      std::memcpy(scheme_[i], object.scheme_[i], length_side_);
    }
    std::memcpy(squares_, object.squares_, sizeof(Square) * MAX_SQUARES_COUNT);
  }

  ~State() {
    for (int8_t i = 0; i < length_side_; ++i) {
      delete[] scheme_[i];
    }
    delete[] scheme_;
    delete[] squares_;
  }

  [[nodiscard]] inline bool IsFull() const {
    for (int8_t i = length_side_ - 1; i >= 0; --i) {
      for (int8_t j = length_side_ - 1; j >= 0; --j) {
        if (!scheme_[i][j]) {
          return false;
        }
      }
    }
    return true;
  }

  [[nodiscard]] inline std::pair<int8_t, int8_t> FindFreePoint() const {
    for (int8_t i = 0; i < length_side_; ++i) {
      for (int8_t j = 0; j < length_side_; ++j) {
        if (!scheme_[i][j]) {
          return {i, j};
        }
      }
    }
    return {-1, -1};
  }

  [[nodiscard]] inline bool IsPossibleToAddSquare(int8_t x_coordinate,
                                                  int8_t y_coordinate,
                                                  int8_t size) const {
    if (x_coordinate + size > length_side_ ||
        y_coordinate + size > length_side_) {
      return false;
    }
    for (int8_t i = x_coordinate; i < x_coordinate + size; ++i) {
      for (int8_t j = y_coordinate; j < y_coordinate + size; ++j) {
        if (scheme_[i][j]) {
          return false;
        }
      }
    }
    return true;
  }

  inline void AddSquare(int8_t x_coordinate, int8_t y_coordinate,
                        int8_t size) {
    for (int8_t i = x_coordinate; i < x_coordinate + size; ++i) {
      for (int8_t j = y_coordinate; j < y_coordinate + size; ++j) {
        scheme_[i][j] = true;
      }
    }
    squares_[squares_count_++] = {x_coordinate, y_coordinate, size};
  }

  void SetStartSquares() {
    // Fixed second-max size of squares
    int8_t first_square_size = (length_side_ + 1) / 2;
    AddSquare(0, 0, first_square_size);
    AddSquare(0, (length_side_ + 1) / 2, first_square_size - 1);
    AddSquare((length_side_ + 1) / 2, 0, first_square_size - 1);
  }

  [[nodiscard]] inline int8_t GetLengthSide() const { return length_side_; }

  [[nodiscard]] inline int8_t GetSquaresCount() const {
    return squares_count_;
  }

  void PrintSquare(int8_t square_number, int8_t scale) {
    int8_t x_coordinate = squares_[square_number].x * scale + 1;
    int8_t y_coordinate = squares_[square_number].y * scale + 1;
    int8_t size = squares_[square_number].size * scale;
    square_number == squares_count_ - 1
        ? printf("%d %d %d", x_coordinate, y_coordinate, size)
        : printf("%d %d %d\n", x_coordinate, y_coordinate, size);
  }

 private:
  bool** scheme_;
  int8_t squares_count_{};
  int8_t length_side_;
  // `Square` struct instead of array of ints for each square
  Square* squares_;
};

void PrintEvenPartiton(int8_t length) {
  printf("%d\n", 4);
  printf("%d %d %d\n", 1, 1, length / 2);
  printf("%d %d %d\n", 1, 1 + length / 2, length / 2);
  printf("%d %d %d\n", 1 + length / 2, 1, length / 2);
  printf("%d %d %d\n", 1 + length / 2, 1 + length / 2, length / 2);
}

void PrintSquaring(State answer, int8_t scale) {
  printf("%d\n", answer.GetSquaresCount());
  for (int8_t i = 0; i < answer.GetSquaresCount(); ++i) {
    answer.PrintSquare(i, scale);
  }
  putchar('\n');
}

// Return divisor instead of overriding via pointers
int8_t FindMinimalDivisor(int8_t divisible) {
  // std::sqrt() instead of pow(x, 0.5)
  for (int8_t i = 2; i <= int8_t(std::sqrt(divisible)); ++i) {
    if (divisible % i == 0) {
      return i;
    }
  }
  return 1;
}

bool IsPrime(int n) {
  const int8_t kPrimes[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37};
  for (int8_t prime : kPrimes) {
    if (n == prime) {
      return true;
    }
  }
  return false;
}

void FindSquarePartition(int8_t length) {
  if (length % 2 == 0) {
    PrintEvenPartiton(length);
    return;
  }
  int8_t divisor = FindMinimalDivisor(length);
  int8_t scale = divisor == 1 ? 1 : length / divisor;
  // Divisor can be 1 -> N is prime
  State start_state = State(divisor == 1 ? length : divisor);
  if (divisor == 1) {
    PRINT("N is prime\n")
  } else {
    PRINT("N is composite -> finding squaring for N=" << divisor << '\n')
  }
  std::queue<State> queue = std::queue<State>();
  queue.push(start_state);
  while (!queue.front().IsFull()) {
    State& current_state = queue.front();
    if (current_state.GetSquaresCount() >= MAX_SQUARES_COUNT) {
      queue.pop();
      continue;
    }
    std::pair<int8_t, int8_t> free_point = current_state.FindFreePoint();
    // Square size is not greater than distance from free point to borders
    int max_square_size =
        std::min(current_state.GetLengthSide() - free_point.first,
                 current_state.GetLengthSide() - free_point.second);
    for (int8_t square_size = max_square_size; square_size > 0;
         --square_size) {
      State new_state = current_state;
      if (current_state.IsPossibleToAddSquare(free_point.first,
                                              free_point.second, square_size)) {
        new_state.AddSquare(free_point.first, free_point.second, square_size);
        queue.push(new_state);
      }
    }
    queue.pop();
  }
  PrintSquaring(queue.front(), scale);
}

int main() {
//  clock_t time = clock();
  int square_side = 0;
  scanf("%d", &square_side);
  FindSquarePartition(square_side);
//  // Displaying test time
//  printf("Test time: %lf\n", double(clock() - time) / CLOCKS_PER_SEC);
  return 0;
}