#pragma GCC optimize("Ofast")
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;
#define pai 3.141592653589793238462643383279




int main(){
  cin.tie(0);
  ios::sync_with_stdio(0);
  vector<int> ans;
  int K; cin >> K; int ichi;
  for(int i=1; i<150; i++){
    if(i*(i-1)/2>K){
      ichi = i-1; break;
    }
  }
  rep(i, ichi){
    ans.push_back(1);
  }
  ans.push_back(3);
  int ima = ichi*(ichi-1)/2;
  //cout << ima << endl;
  rep(i, K-ima){
    ans.push_back(8);
  }
  cout << ans.size() << endl;
  for(auto k: ans){
    cout << k << " ";
  }
  cout << endl;
}