#include <bits/stdc++.h>
using namespace ::std;
int fx[] = {0, 0, 1, -1, 1, -1, 1, -1};
int fy[] = {1, -1, 0, 0, 1, 1, -1, -1};
template <class T>
T Square(T a) {
  return T(a * a);
}
template <class T, class S>
S Distance(T a, T b) {
  return S(sqrt(S(Square(S(a)) + Square(S(b)))));
}
template <class T>
T Tbits(T a) {
  T c(0);
  while (++c, a /= 2, a)
    ;
  return c;
}
template <class T>
T Obits(T a) {
  T c(0);
  while (c += (a & 1), a /= 2, a)
    ;
  return c;
}
template <class T>
T Gcd(T a, T b) {
  T c(0);
  if (b)
    while (b, c = a % b, a = b, b = c, b)
      ;
  return a;
}
template <class T>
void Failure(T F[], string text, T sz) {
  memset(F, 0, sizeof F);
  T i, j;
  for (i = 2; i <= sz; ++i) {
    for (j = F[i - 1]; j and text[i - 1] != text[j]; j = F[j])
      ;
    if (text[i - 1] == text[j]) F[i] = ++j;
  }
}
int N, C, R, M, K;
int DeadPool[107][107];
const long long mod = 1e9 + 7;
vector<int> dig;
int Hash(vector<int> x) {
  long long prime = 1, res = 0;
  for (int i = 0; i < x.size(); ++i)
    res = (res + prime * x[i]) % mod, prime = (prime * 153LL) % mod;
  int d = res;
  return d;
}
int rec() {}
int main() {
  int test, t(1), a, b = 0;
  int offer, Product, items, value, tog;
  cin >> offer;
  cout << offer << endl;
  for (int i = 0; i < offer; ++i) cout << 1 << ' ';
}
