#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
long long power(long long chand, long long bechand) {
  if (bechand == 0) return 1;
  long long h = 0;
  h = power(chand, bechand / 2ll);
  h = (h * h) % mod;
  if (bechand % (2ll) == 1) h = (h * chand) % mod;
  return h;
}
int main() {
  int a;
  cin >> a;
  cout << a << endl;
  for (int i = 0; i < a; i++) cout << "1 ";
  return 0;
}
