#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1000000;
template <typename T>
void printV(const std::vector<T>& v, const char* const separator = " ") {
  if (!v.empty()) {
    std::copy(v.begin(), --v.end(),
              std::ostream_iterator<T>(std::cout, separator));
    std::cout << v.back() << "\n";
  }
}
int64_t gcd(int64_t a, int64_t b) { return b != 0 ? gcd(b, a % b) : a; }
int64_t lcm(int64_t a, int64_t b) { return a / gcd(a, b) * b; }
int Max(int a, int b, int c) {
  int temp = max(a, b);
  return max(temp, c);
}
int Min(int a, int b, int c) {
  int temp = min(a, b);
  return min(temp, c);
}
bool integer(double num) { return floor(num) == num; }
int64_t fact(int num) {
  if (num == 0)
    return 1;
  else
    return num * fact(num - 1);
}
void y() {
  cout << "Yes"
       << "\n";
  exit(0);
}
void n() {
  cout << "No"
       << "\n";
  exit(0);
}
void Y() {
  cout << "YES"
       << "\n";
  exit(0);
}
void N() {
  cout << "NO"
       << "\n";
  exit(0);
}
int64_t yakusu(int n) {
  int cnt = 0;
  for (int i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      cnt++;
      if (i * i != n) cnt++;
    }
  }
  return cnt;
}
int cnt = 0;
bool is_prime[50000 + 1];
vector<int> P;
void Eratosthenes(const int N) {
  for (int i = 0; i <= N; i++) {
    is_prime[i] = true;
  }
  for (int i = 2; i <= N; i++) {
    if (is_prime[i]) {
      for (int j = 2 * i; j <= N; j += i) {
        is_prime[j] = false;
      }
      P.emplace_back(i);
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  ;
  vector<int> a(10);
  printV(a);
  cout << "\n";
  return 0;
}
