#include <bits/stdc++.h>
using namespace std;
long long prime[10000001] = {0};
int GCD(int A, int B) {
  int m = min(A, B), gcd;
  for (int i = m; i > 0; --i)
    if (A % i == 0 && B % i == 0) {
      gcd = i;
      return gcd;
    }
}
long long count_one(long long n) {
  long long count1 = 0;
  while (n) {
    n = n & (n - 1);
    count1++;
  }
  return count1;
}
string HexToBin(char c) {
  long int i = 0;
  switch (c) {
    case '0':
      return "0000";
      break;
    case '1':
      return "0001";
      break;
    case '2':
      return "0010";
      break;
    case '3':
      return "0011";
      break;
    case '4':
      return "0100";
      break;
    case '5':
      return "0101";
      break;
    case '6':
      return "0110";
      break;
    case '7':
      return "0111";
      break;
    case '8':
      return "1000";
      break;
    case '9':
      return "1001";
      break;
    case 'A':
    case 'a':
      return "1010";
      break;
    case 'B':
    case 'b':
      return "1011";
      break;
    case 'C':
    case 'c':
      return "1100";
      break;
    case 'D':
    case 'd':
      return "1101";
      break;
    case 'E':
    case 'e':
      return "1110";
      break;
    case 'F':
    case 'f':
      return "1111";
      break;
    default:
      cout << "\nInvalid hexadecimal digit ";
  }
}
std::vector<pair<long long, long long> > v[5200];
int check(long long x, long long n) {
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < n; j++) {
      if (v[i][j] != v[i / x][j / x]) return 0;
    }
  }
  return 1;
}
long long bs(long long l, long long h) {
  long long n1 = h;
  while (h > l) {
    long long mid = l + (h - l) / 2;
    if (check(mid, n1) == 0) {
      h = mid;
    } else {
      l = mid + 1;
    }
  }
  return h;
}
int main() {
  long long n;
  cin >> n;
  printf("%lld\n", n);
  for (long long i = 0; i < n; i++) {
    printf("1 ");
  }
  printf("\n");
}
