use std::io::Write;
use std::collections::*;

type Map<K, V> = BTreeMap<K, V>;
type Set<T> = BTreeSet<T>;
type Deque<T> = VecDeque<T>;

fn main() {
    input!(n: usize);
    let (e, a) = solve(n);
    let out = std::io::stdout();
    let mut out = std::io::BufWriter::new(out.lock());
    writeln!(out, "{}", e.len()).ok();
    for (a, b, w) in e {
        writeln!(out, "{a} {b} {w}").ok();
    }
    for a in a {
        use util::*;
        writeln!(out, "{} {}", a.len(), a.iter().join(" ")).ok();
    }
}

fn solve(n: usize) -> (Vec<(usize, usize, usize)>, Vec<Vec<usize>>) {
    if n == 2 {
        return (vec![(1, 2, 1)], vec![vec![1]]);
    }
    let mut e = vec![];
    let mut ans = vec![];
    let mut map = Map::new();
    let mut add_edge = |a: usize, b: usize, w: usize| {
        let k = e.len() + 1;
        e.push((a + 1, b + 1, w));
        map.insert((a, b, w), k);
        map.insert((b, a, w), k);
    };
    if n % 2 == 1 {
        for i in 0..(n - 1) {
            add_edge(i, n - 1, 1);
            if i % 2 == 1 {
                add_edge(i - 1, i, 1);
            }
        }
        drop(add_edge);
        for s in 0..n {
            for t in (s + 1)..n {
                let v = if t == n - 1 || t == s ^ 1 {
                    vec![s, t]
                } else {
                    vec![s, s ^ 1, n - 1, t ^ 1, t]
                };
                let e = v.windows(2).map(|p| map[&(p[0], p[1], 1)]).collect();
                ans.push(e);
            }
        }
    } else {
        add_edge(0, 1, 1);
        add_edge(0, 1, 2);
        for i in 2..n {
            add_edge(1, i, 1);
            if i % 2 == 1 {
                add_edge(i - 1, i, 1);
            }
        }
        drop(add_edge);
        ans.push(vec![1]);
        for i in 2..n {
            let v = vec![0, 1, i ^ 1, i];
            let w = vec![2, 1, 1];
            let e = (1..4).map(|i| map[&(v[i - 1], v[i], w[i - 1])]).collect();
            ans.push(e);
        }
        for s in 1..n {
            for t in (s + 1)..n {
                let v = if s == 1 || t == s ^ 1 {
                    vec![s, t]
                } else {
                    vec![s, s ^ 1, 1, t ^ 1, t]
                };
                let e = v.windows(2).map(|p| map[&(p[0], p[1], 1)]).collect();
                ans.push(e);
            }
        }
    }
    (e, ans)
}

// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[macro_export]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

#[macro_export]
macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

#[macro_export]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------
mod util {
    pub trait Join {
        fn join(self, sep: &str) -> String;
    }

    impl<T, I> Join for I
    where
        I: Iterator<Item = T>,
        T: std::fmt::Display,
    {
        fn join(self, sep: &str) -> String {
            let mut s = String::new();
            use std::fmt::*;
            for (i, v) in self.enumerate() {
                if i > 0 {
                    write!(&mut s, "{}", sep).ok();
                }
                write!(&mut s, "{}", v).ok();
            }
            s
        }
    }
}