func_code_string: #include <bits/stdc++.h>   using namespace std;   inline int IN() {     int x = 0, ch = getchar(), f = 1;     while (!isdigit(ch) && (ch !=  - ) && (ch != EOF)) ch = getchar();     if (ch ==  - ) {       f = -1;       ch = getchar();     }     while (isdigit(ch)) {       x = (x << 1) + (x << 3) + ch -  0 ;       ch = getchar();     }     return x * f;   }   struct Flower {     long long x, y, da, db;     bool operator<(const Flower& w) const { return da < w.da; }   } a, b, c[2005];   long long Dist(Flower a, Flower b) {     return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y);   }   int n;   long long mxb[2005];   int main() {     n = IN();     a.x = 1ll * IN(), a.y = 1ll * IN();     b.x = 1ll * IN(), b.y = 1ll * IN();     for (int i = 1; i <= n; i++) {       c[i].x = 1ll * IN(), c[i].y = 1ll * IN();       c[i].da = Dist(c[i], a);       c[i].db = Dist(c[i], b);     }     sort(c + 1, c + n + 1);     mxb[n + 1] = 0;     for (int i = n; i >= 1; i--) mxb[i] = max(mxb[i + 1], c[i].db);     long long Ans = mxb[1], ND = 0;     for (int i = 2; i <= n + 1; i++) Ans = min(Ans, c[i - 1].da + mxb[i]);     printf( %I64d n , Ans);   }   