#include<bits/stdc++.h>
using namespace std;

int is_prime(int n){
  if(n<2) return 0;
  else if(n==2) return 1;
  else if(n%2==0) return 0;

  double sqrtNum = sqrt(n);
    for (int i = 3; i <= sqrtNum; i += 2)
    {
        if (n % i == 0)
        {
            return 0;
        }
    }
    return 1;
}

int main(){
  int n;
  cin >> n;
  int cnt=0;
  int cal=11;
  vector<int> ans;
  while(cnt!=n){
    if(is_prime(cal)){
      if(cal%5==1){
        ans.push_back(cal);
        cnt++;
        //cout << cal << endl;
      }
    }

    cal++;
  }
  for(int i=0;i<n;++i){
    if(i!=n-1) cout << ans[i] << " ";
    else cout << ans[i] << endl;
  }

  return 0;
}

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <stdio.h>
#include <complex>
#include <cstdint>
#include <tuple>
#include <regex>
#include <numeric>

#define M_PI       3.14159265358979323846

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;

//container util

//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define MOD 1000000007
#define SQ(x) ((x)*(x))

int main() {
	LL k;
	cin >> k;
	int n = 50;
	VLL ret(n);
	LL x = (k + 49) / 50 - 1;
	LL t = ((k + 49) / 50) * 50;
	REP(i, n) ret[i] = 50 + x - i;
	int loop = ((k + 49) / 50) * 50 - k;
	REP(i, loop) {
		REP(j, n) {
			ret[j]++;
		}
		ret[i] -= 51;
	}
	printf("%d\n", n);
	REP(i, n)printf("%lld ", ret[i]);
	printf("\n");
	return 0;
}