#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.15f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;
int n;
double x[300][3], p[3], t[3], z[3];
inline void mi(int a, int b, double c[3]){
  FOR(i, 0, 3)c[i] = x[a][i] - x[b][i];
}
inline double ip(double a[3], double b[3]){
  return abs(a[0]*b[0]+a[1]*b[1]+a[2]*b[2]);
}
inline void op(double a[3], double b[3], double c[3]){
  FOR(i, 0, 3){
    c[i] = a[(i+1)%3]*b[(i+2)%3] - a[(i+2)%3]*b[(i+1)%3];
  }
}
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n;
  FOR(i, 0, 3)cin >> p[i];
  FOR(i, 0, n){
    FOR(j, 0, 3)cin >> x[i][j];
    FOR(j, 0, 3)x[i][j] -= p[j];
  }
  double ans = 0.;
  FOR(i, 0, n-2)FOR(j, i+1, n-1)FOR(k, j+1, n){
    mi(i, j, p);
    mi(i, k, t);
    op(p, t, z);
    ans += ip(x[i], z) / sqrt(ip(z,z));
  }
  dout(ans);
  return 0;
}