10000000 10000000

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

//    0. Enough array size? Enough array size? Enough array size? Integer overflow?

//    1. Think TWICE, Code ONCE!
//    Are there any counterexamples to your algo?

//    2. Be careful about the BOUNDARIES!
//    N=1? P=1? Something about 0?

//    3. Do not make STUPID MISTAKES!
//    Time complexity? Memory usage? Precision error?

#define debug(args...) fprintf(stderr, ##args)
#define gc getchar
#define fi first
#define se second
#define mst(a, x) memset(a, x, sizeof a)
#define repeat(i, a, b) for (int i = (a), _ = (b); i <= _; ++i)
#define repeat_back(i, a, b) for (int i = (b), _ = (a); i >= _; --i)
#define repeatll(i, a, b) for (ll i = (a), _ = (b); i <= _; ++i)
#define repeat_backll(i, a, b) for (ll i = (b), _ = (a); i >= _; --i)
#define minv(a, b) (a = a < b ? a : b)
#define maxv(a, b) (a = a > b ? a : b)
using ll = long long;

template<int size = 1 << 20>
struct IO {
    char in[size], out[size], *p1, *p2, *pp;
    IO() : p1(in), p2(in), pp(out) {}
    ~IO() { fwrite(out, 1, pp - out, stdout); }
    inline char gc() { if (p1 == p2) p2 = (p1 = in) + fread(in, 1, size, stdin); return p1 == p2 ? ' ' : *p1++; }
    inline bool blank(char ch) { return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t'; }
    template<class T> inline void read(T& x) { double tmp = 1; bool sign = 0; x = 0; char ch = gc(); for (; !isdigit(ch); ch = gc()) sign |= ch == 45; for (; isdigit(ch); ch = gc()) x = x * 10 + ch - 48; if (ch == '.') for (ch = gc(); isdigit(ch); ch = gc()) tmp /= 10.0, x += tmp * (ch - '0'); if (sign) x = -x; }
    inline void read(string& s) { char ch = gc(); for (; blank(ch); ch = gc()); for (; !blank(ch); ch = gc()) s += ch; }
    inline void read(char& c) { while (!blank(c)) c = gc(); }
    template<typename T, typename... Args> inline void read(T& x, Args&... args) { read(x), read(args...); }
    inline void push(const char& c) { if (pp - out == size) fwrite(out, 1, size, stdout), pp = out; *pp++ = c; }
    inline void write(char c) { push(c); }
    inline void write(char* s) { for (int i = 0; s[i]; ++i) push(s[i]); }
    inline void write(string s) { for (auto x : s) push(x); }
    template<class T> inline void write(T x) { if (x < 0) x = -x, push('-'); static T sta[35]; T top = 0; do sta[top++] = x % 10, x /= 10; while (x); while (top) push(sta[--top] + '0'); }
    template<class T> inline void write(T x, char c) { write(x), push(c); }
    template<typename T, typename... Args> inline void write(const T x, const Args... args) { write(x), write(args...); }
    void file(const string s) { freopen((s + ".in").c_str(), "r", stdin), freopen((s + ".out").c_str(), "w", stdout); }
    template<typename T> IO& operator>>(T& x) { read(x); return *this; }    
    template<typename T> IO& operator<<(const T x) { write(x); return *this; }
};
IO<> io;

unsigned seed = chrono::system_clock::now().time_since_epoch().count();
mt19937 rnd(seed);
mt19937_64 rnd64(seed);

const ll inf = 1e18;
const int N = 1e7 + 7;

int x;

int main() {
    

    return 0;
}

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

//    0. Enough array size? Enough array size? Enough array size? Integer overflow?

//    1. Think TWICE, Code ONCE!
//    Are there any counterexamples to your algo?

//    2. Be careful about the BOUNDARIES!
//    N=1? P=1? Something about 0?

//    3. Do not make STUPID MISTAKES!
//    Time complexity? Memory usage? Precision error?

#define debug(args...) fprintf(stderr, ##args)
#define gc getchar
#define fi first
#define se second
#define mst(a, x) memset(a, x, sizeof a)
#define repeat(i, a, b) for (int i = (a), _ = (b); i <= _; ++i)
#define repeat_back(i, a, b) for (int i = (b), _ = (a); i >= _; --i)
#define repeatll(i, a, b) for (ll i = (a), _ = (b); i <= _; ++i)
#define repeat_backll(i, a, b) for (ll i = (b), _ = (a); i >= _; --i)
#define minv(a, b) (a = a < b ? a : b)
#define maxv(a, b) (a = a > b ? a : b)
using ll = long long;

template<int size = 1 << 20>
struct IO {
    char in[size], out[size], *p1, *p2, *pp;
    IO() : p1(in), p2(in), pp(out) {}
    ~IO() { fwrite(out, 1, pp - out, stdout); }
    inline char gc() { if (p1 == p2) p2 = (p1 = in) + fread(in, 1, size, stdin); return p1 == p2 ? ' ' : *p1++; }
    inline bool blank(char ch) { return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t'; }
    template<class T> inline void read(T& x) { double tmp = 1; bool sign = 0; x = 0; char ch = gc(); for (; !isdigit(ch); ch = gc()) sign |= ch == 45; for (; isdigit(ch); ch = gc()) x = x * 10 + ch - 48; if (ch == '.') for (ch = gc(); isdigit(ch); ch = gc()) tmp /= 10.0, x += tmp * (ch - '0'); if (sign) x = -x; }
    inline void read(string& s) { char ch = gc(); for (; blank(ch); ch = gc()); for (; !blank(ch); ch = gc()) s += ch; }
    inline void read(char& c) { while (!blank(c)) c = gc(); }
    template<typename T, typename... Args> inline void read(T& x, Args&... args) { read(x), read(args...); }
    inline void push(const char& c) { if (pp - out == size) fwrite(out, 1, size, stdout), pp = out; *pp++ = c; }
    inline void write(char c) { push(c); }
    inline void write(char* s) { for (int i = 0; s[i]; ++i) push(s[i]); }
    inline void write(string s) { for (auto x : s) push(x); }
    template<class T> inline void write(T x) { if (x < 0) x = -x, push('-'); static T sta[35]; T top = 0; do sta[top++] = x % 10, x /= 10; while (x); while (top) push(sta[--top] + '0'); }
    template<class T> inline void write(T x, char c) { write(x), push(c); }
    template<typename T, typename... Args> inline void write(const T x, const Args... args) { write(x), write(args...); }
    void file(const string s) { freopen((s + ".in").c_str(), "r", stdin), freopen((s + ".out").c_str(), "w", stdout); }
    template<typename T> IO& operator>>(T& x) { read(x); return *this; }    
    template<typename T> IO& operator<<(const T x) { write(x); return *this; }
};
IO<> io;

unsigned seed = chrono::system_clock::now().time_since_epoch().count();
mt19937 rnd(seed);
mt19937_64 rnd64(seed);

const ll inf = 1e18;
const int N = 1e7 + 7;

ll n, x = 1e8;

int main() {
    io >> n;
	repeat(i, 1, n) io << x << ' ';

    return 0;
}