#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T sqr(T x) {
  return x * x;
}
template <class T>
inline string tostr(const T &x) {
  stringstream ss;
  ss << x;
  return ss.str();
}
inline long long parse(const string &s) {
  stringstream ss(s);
  long long x;
  ss >> x;
  return x;
}
const double EPS = 1e-10;
const int INF = 1000 * 1000 * 1000;
const long long LINF = INF * 1ll * INF;
const double DINF = 1e200;
const double PI = 3.1415926535897932384626433832795l;
int gcd(int a, int b) { return a ? gcd(b % a, a) : b; }
long long gcd(long long a, long long b) { return a ? gcd(b % a, a) : b; }
long long gcdex(long long a, long long b, long long &x, long long &y) {
  if (!a) {
    x = 0, y = 1;
    return b;
  }
  long long k = b / a;
  long long g = gcdex(b - k * a, a, y, x);
  x -= k * y;
  return g;
}
long long inv(long long a, long long m) {
  long long x, y, g;
  g = gcdex(a, m, x, y);
  return (x % (m / g) + m / g) % m / g;
}
long long crt(long long a1, long long m1, long long a2, long long m2) {
  long long a = (a2 - a1 % m2 + m2) % m2;
  long long x, y, g;
  g = gcdex(m1, m2, x, y);
  if (a % g) return -1;
  long long m = m1 / g * m2;
  x *= a / g;
  x = (x % m2 + m2) % m2;
  long long r = (a1 + x * m1) % m;
  assert(r % m1 == a1 && r % m2 == a2);
  return r;
}
long long powmod(long long a, long long p, long long m) {
  long long r = 1;
  while (p) {
    if (p & 1) r = r * a % m;
    p >>= 1;
    a = a * a % m;
  }
  return r;
}
bool isprime(long long a) {
  if (a <= 1) return false;
  for (long long i = 2; i * i <= a; ++i) {
    if (a % i == 0) return false;
  }
  return true;
}
long long sqrtup(long long a) {
  if (!a) return 0;
  long long x = max(0ll, (long long)sqrt((double)a));
  while (x * x >= a) --x;
  while ((x + 1) * (x + 1) < a) ++x;
  return x + 1;
}
long long isqrt(long long a) {
  long long x = max(0ll, (long long)sqrt((double)a));
  while (x * x > a) --x;
  while ((x + 1) * (x + 1) <= a) ++x;
  return x;
}
template <class T>
ostream &operator<<(ostream &s, const vector<T> &v);
template <class A, class B>
ostream &operator<<(ostream &s, const pair<A, B> &p);
template <class K, class V>
ostream &operator<<(ostream &s, const map<K, V> &m);
template <class T, size_t N>
ostream &operator<<(ostream &s, const array<T, N> &a);
template <class T>
ostream &operator<<(ostream &s, const vector<T> &v) {
  s << '[';
  for (int i = 0; i < (((int)(v).size())); ++i) {
    if (i) s << ',';
    s << v[i];
  }
  s << ']';
  return s;
}
template <class A, class B>
ostream &operator<<(ostream &s, const pair<A, B> &p) {
  s << "(" << p.first << "," << p.second << ")";
  return s;
}
template <class K, class V>
ostream &operator<<(ostream &s, const map<K, V> &m) {
  s << "{";
  bool f = false;
  for (const auto &it : m) {
    if (f) s << ",";
    f = true;
    s << it.first << ": " << it.second;
  }
  s << "}";
  return s;
}
template <class T>
ostream &operator<<(ostream &s, const set<T> &m) {
  s << "{";
  bool f = false;
  for (const auto &it : m) {
    if (f) s << ",";
    f = true;
    s << it;
  }
  s << "}";
  return s;
}
template <class T>
ostream &operator<<(ostream &s, const multiset<T> &m) {
  s << "{";
  bool f = false;
  for (const auto &it : m) {
    if (f) s << ",";
    f = true;
    s << it;
  }
  s << "}";
  return s;
}
template <class T, size_t N>
ostream &operator<<(ostream &s, const array<T, N> &a) {
  s << '[';
  for (int i = 0; i < (((int)(a).size())); ++i) {
    if (i) s << ',';
    s << a[i];
  }
  s << ']';
  return s;
}
template <size_t n, class... T>
struct put1 {
  static ostream &put(ostream &s, const tuple<T...> &t) {
    s << get<sizeof...(T) - n>(t);
    if (n > 1) s << ',';
    return put1<n - 1, T...>::put(s, t);
  }
};
template <class... T>
struct put1<0, T...> {
  static ostream &put(ostream &s, const tuple<T...> &t) { return s; }
};
template <class... T>
ostream &operator<<(ostream &s, const tuple<T...> &t) {
  s << "(";
  put1<sizeof...(T), T...>::put(s, t);
  s << ")";
  return s;
}
ostream &put2(ostream &s, const tuple<> &t) { return s; }
template <class U>
ostream &put2(ostream &s, const tuple<U> &t) {
  return s << get<0>(t);
}
template <class U, class V, class... T>
ostream &put2(ostream &s, const tuple<U, V, T...> &t) {
  return s << t;
}
pair<long long, long long> mer(pair<long long, long long> a,
                               pair<long long, long long> b) {
  return make_pair(min(a.first, b.first), max(a.second, b.second));
}
struct sol {
  vector<long long> xs;
  vector<pair<long long, long long> > P, S;
  sol(vector<pair<long long, long long> > A) : xs(((int)(A).size())) {
    for (int i = 0; i < (((int)(A).size())); ++i) {
      xs[i] = A[i].first;
    }
    sort((xs).begin(), (xs).end());
    xs.erase(unique((xs).begin(), (xs).end()), xs.end());
    vector<pair<long long, long long> > V(((int)(xs).size()) + 1,
                                          make_pair(LINF, -LINF));
    P = S = V;
    for (int i = 0; i < (((int)(A).size())); ++i) {
      int x = lower_bound((xs).begin(), (xs).end(), A[i].first) - xs.begin();
      V[x] = mer(V[x], make_pair(A[i].second, A[i].second));
    }
    for (int i = 0; i < (((int)(xs).size())); ++i) {
      P[i + 1] = mer(P[i], V[i]);
    }
    for (int i = ((int)(xs).size()) - 1; i >= 0; --i) {
      S[i] = mer(S[i + 1], V[i]);
    }
  }
  bool check(long long D) {
    long long d = isqrt(D);
    if (S[0].second - S[0].first <= d) return true;
    for (int a = 0; a < (((int)(xs).size())); ++a) {
      if (xs[a] > 0) break;
      int b = upper_bound((xs).begin(), (xs).end(), min(-xs[a], xs[a] + d)) -
              xs.begin();
      pair<long long, long long> t = mer(P[a], S[b]);
      if (t.first == LINF || (t.second - t.first <= d &&
                              sqr(max(t.second, -t.first)) + sqr(-xs[a]) <= D))
        return true;
    }
    return false;
  }
};
int main(int argc, char **argv) {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<pair<long long, long long> > A(n);
  for (int i = 0; i < (n); ++i) {
    cin >> A[i].first >> A[i].second;
  }
  sol L(A);
  for (int i = 0; i < (((int)(A).size())); ++i) {
    A[i].first *= -1;
  }
  sol R(A);
  long long a = -1, b = LINF;
  while (b > a + 1) {
    long long c = (a + b) / 2;
    if (L.check(c) || R.check(c))
      b = c;
    else
      a = c;
  }
  assert(b < LINF);
  cout << b;
  return 0;
}
