#include<algorithm>
#include<cstdio>
#include<vector>
#include<cmath>
typedef long long ll;
const int lim=130;
const int delta=(int)1e3;
ll n;
std::vector<int>op;
void get(ll x,ll y){
	if(!x){
		while(y&&op.size()<=lim){
			y--;
			op.push_back(2);
		}
		return;
	}
	if(!y){
		while(x&&op.size()<=lim){
			x--;
			op.push_back(1);
		}
		return;
	}
	if(x<y){
		get(x,y-x);
		op.push_back(4);
	}
	else{
		get(x-y,y);
		op.push_back(3);
	}
	return;
}
signed main(){
	scanf("%lld",&n);
	double wz=(sqrt(5.0)-1.0)/2.0*1.0*n;
	ll now=wz;
	for(ll i=std::max(now-delta,0ll);i<=now+delta;i++){
		get(n,i);
		if(op.size()>lim)op.clear();
		else{
			printf("%d\n",op.size());
			for(int j=0;j<(int)op.size();j++)printf("%d\n",op[j]);
			break;
		}
	}
	return 0;
}
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll I=1167167167167167167;
ll Q=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
template<class T> void print_tate(vector<T> &v) {rep(i,v.size()) cout<<v[i]<<"\n";}
void yneos(bool a){if(a) cout<<"Yes"<<"\n"; else cout<<"No"<<"\n";}



//おちこんだりもしたけれど、私はげんきです。
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	
	
	rep(i,20){
		rep(j,20){
			cout<<(char)('A'+(rand()%8));
		}
		cout<<"\n";
	}
}

