Submission #4021606

---

Source Code Expand

#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>

using namespace std;

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = n;i >= m;i--)
#define REPO(i, n) for(int i = 1;i <= n;i++)
#define ll long long
#define INF 1999999999
#define MINF -1999999999
#define ALL(n) n.begin(),n.end()

int main() {
	int n;
	cin >> n;
	if (n == 1) {
		cout << "Yes" << endl;
		cout << "2" << endl;
		cout << "1 1" << endl;
		cout << "1 1" << endl;
	}
	else if (n == 3) {
		cout << "Yes" << endl;
		cout << "3" << endl;
		cout << "2 1 2" << endl;
		cout << "2 3 1" << endl;
		cout << "2 2 3" << endl;

	}
	else cout << "No" << endl;
}

Submission Info

Judge Result