func_code_string: #include <bits/stdc++.h>   namespace algo {   using std::swap;   const long double PI = 3.141592653589793238462643383279502884L;   const long double E = 2.718281828459045235360287471352662498L;   const long double EPS = 1e-12L;   template <typename T1, typename T2>   T1 bin_pow(T1 a, T2 n) {     T1 r{1};     while (n > 0) {       if (n % 2 == 1) r *= a;       a *= a;       n /= 2;     }     return r;   }   template <typename T1, typename T2>   T1 bin_pow(T1 a, T2 n, const T1& m) {     if (m == 1) return 0;     T1 r{1};     while (n > 0) {       if (n % 2 == 1) {         r *= a;         r %= m;       }       a *= a;       a %= m;       n /= 2;     }     return r;   }   template <typename T>   T gcd(const T& a, const T& b) {     if (b == 0) return a < 0 ? -a : a;     return gcd(b, a % b);   }   template <typename T>   T gcd(const T& a, const T& b, T& x, T& y) {     if (b == 0) {       x = a < 0 ? -1 : 1;       y = 0;       return x * a;     }     T d{gcd(b, a % b, y, x)};     y -= (a / b) * x;     return d;   }   template <typename T>   T lcm(const T& a, const T& b) {     T r{a / gcd(a, b) * b};     return r < 0 ? -r : r;   }   template <typename T>   T mod_add(const T& a, const T& b, const T& m) {     if (a < m - b) return a + b;     return a - (m - b);   }   template <typename T>   T mod_sub(const T& a, const T& b, const T& m) {     if (a < b) return a + (m - b);     return a - b;   }   template <typename T>   T mod_mul(T a, T b, const T& m) {     if (b > a) swap(a, b);     T r{0};     while (b > 0) {       if (b % 2 == 1) r = mod_add(r, a, m);       a = mod_add(a, a, m);       b /= 2;     }     return r;   }   template <typename T1, typename T2>   T1 mod_pow(T1 a, T2 n, const T1& m) {     if (m == 1) return 0;     T1 r{1};     while (n > 0) {       if (n % 2 == 1) r = mod_mul(r, a, m);       a = mod_mul(a, a, m);       n /= 2;     }     return r;   }   template <typename T>   T mod_inv(const T& a, const T& m) {     T x, y;     T d{gcd(a, m, x, y)};     if (d != 1) return 0;     if (x < 0) x += m;     return x;   }   template <typename T>   T phi(T n) {     T t = std::sqrt(n) + EPS;     T r = n;     for (T i = 2; i <= t; ++i) {       if (n % i == 0) {         r -= r / i;         do {           n /= i;         } while (n % i == 0);         t = std::sqrt(n) + EPS;       }     }     if (n > 1) r -= r / n;     return r;   }   class LinearPhi {    public:     LinearPhi(uint32_t n = 1 << 20) : size_{n} {       assert(size_ > 0 &&  Size should be nonzero );       assert(size_ <= INT32_MAX &&  Size should fit into an 32-bit signed int );       uint32_t sz = (size_ + 1) / 2;       phi_ = new int32_t[sz];       mark_.assign(sz, false);       phi_[0] = 1;       if (size_ > 1) primes_.push_back(2);       for (uint32_t i = 1; i < sz; ++i) {         uint32_t val = i << 1 | 1;         if (!mark_[i]) {           phi_[i] = val - 1;           primes_.push_back(val);         }         if (val < sz) {           for (uint32_t j = 1; j < primes_.size(); ++j) {             uint32_t t = val * primes_[j];             if (t > size_) break;             mark_[t >> 1] = true;             if (val % primes_[j] == 0) {               phi_[t >> 1] = phi_[i] * primes_[j];               break;             }             phi_[t >> 1] = phi_[i] * (primes_[j] - 1);           }         }       }     }     LinearPhi(const LinearPhi&) = delete;     LinearPhi& operator=(const LinearPhi&) = delete;     ~LinearPhi() {       delete[] phi_;       phi_ = nullptr;     }     const uint32_t& size() const { return size_; }     int32_t phi(int32_t i) const {       int32_t r = 1;       int k = __builtin_ctz(i);       if (k > 0) {         i >>= k;         r <<= k - 1;       }       return r * phi_[i >> 1];     }     int32_t operator[](int32_t i) const { return phi(i); }     const std::vector<int32_t>& primes() const { return primes_; }       private:     int32_t* phi_ = nullptr;     std::vector<bool> mark_;     uint32_t size_;     std::vector<int32_t> primes_;   };   class Sieve {    public:     Sieve(uint32_t n = 1 << 20) : size_{n} {       assert(size_ > 0 &&  Size should be nonzero );       assert(size_ <= INT32_MAX &&  Size should fit into an 32-bit signed int );       uint32_t sz = (size_ + 1) / 2;       prime_.assign(sz, true);       prime_[0] = false;       for (uint32_t i = 1; i < sz; ++i) {         uint32_t val = i << 1 | 1;         if (prime_[i] && val * 1ULL * val <= size_)           for (uint32_t j = val * val; j <= size_; j += 2 * val)             prime_[j >> 1] = false;       }     }     Sieve(const Sieve&) = delete;     Sieve& operator=(const Sieve&) = delete;     const uint32_t& size() const { return size_; }     bool isPrime(const int32_t& i) const {       if (i % 2 == 0) return i == 2;       return prime_[i >> 1];     }     bool operator[](const int32_t& i) const { return isPrime(i); }       private:     uint32_t size_;     std::vector<bool> prime_;   };   class LinearSieve {    public:     LinearSieve(uint32_t n = 1 << 20) : size_{n} {       assert(size_ > 0 &&  Size should be nonzero );       assert(size_ <= INT32_MAX &&  Size should fit into an 32-bit signed int );       uint32_t sz = (size_ + 1) / 2;       lpf_ = new uint16_t[sz];       std::fill(lpf_, lpf_ + sz, 0);       lpf_[0] = 1;       if (size_ > 1) primes_.push_back(2);       for (uint32_t i = 1; i < sz; ++i) {         uint32_t val = i << 1 | 1;         if (!lpf_[i]) primes_.push_back(val);         if (val < sz) {           for (uint32_t j = 1; j < primes_.size(); ++j) {             uint32_t t = val * primes_[j];             if (t > size_) break;             lpf_[t >> 1] = static_cast<uint16_t>(primes_[j]);             if (lpf_[t >> 1] == (lpf_[i] ? lpf_[i] : val)) break;           }         }       }     }     LinearSieve(const LinearSieve&) = delete;     LinearSieve& operator=(const LinearSieve&) = delete;     ~LinearSieve() {       delete[] lpf_;       lpf_ = nullptr;     }     const uint32_t& size() const { return size_; }     bool isPrime(const int32_t& i) const {       if (i % 2 == 0) return i == 2;       return !lpf_[i >> 1];     }     bool operator[](const int32_t& i) const { return isPrime(i); }     int32_t lpf(const int32_t& i) const {       if (i % 2 == 0) return 2;       if (!lpf_[i >> 1]) return i;       return lpf_[i >> 1];     }     int32_t phi(int32_t i) const {       int32_t r = 1;       int k = __builtin_ctz(i);       if (k > 0) {         i >>= k;         r <<= k - 1;       }       int32_t n, t = lpf_[i >> 1] ? lpf_[i >> 1] : i;       while (t != 1) {         r *= (t - 1);         i /= t;         n = lpf_[i >> 1] ? lpf_[i >> 1] : i;         while (n == t) {           r *= n;           i /= t;           n = lpf_[i >> 1] ? lpf_[i >> 1] : i;         }         t = n;       }       return r;     }     const std::vector<int32_t>& primes() const { return primes_; }       private:     uint16_t* lpf_ = nullptr;     uint32_t size_;     std::vector<int32_t> primes_;   };   }  // namespace algo   using namespace std;   using namespace algo;   namespace task {   int x1, y1, x2, y2, x3, y3;   int main() {     cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3;     cout << 3 <<   n ;     cout << x3 - x1 + x2 <<     << y3 - y1 + y2 <<   n ;     cout << x1 - x2 + x3 <<     << y1 - y2 + y3 <<   n ;     cout << x2 - x3 + x1 <<     << y2 - y3 + y1 <<   n ;     return 0;   }   }  // namespace task   int main() {     ios_base::sync_with_stdio(false);     cin.tie(nullptr);     cout.precision(11);     cout.setf(ios::fixed);     return task::main();   }   