#include<bits/stdc++.h> using namespace std; struct xxs{ int x,id; }a[300005]; bool cmp(xxs xx,xxs yy){ return xx.x<yy.x; } int b[300005],sum,maxx,minn,n,ans=1000000005; int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>a[i].x>>a[i+n].x>>a[i+2*n].x; a[i].id=a[i+n].id=a[i+2*n].id=i; } n*=3; sort(a+1,a+n+1,cmp); for(int l=1,r=1;r<=n;r++){ if(b[a[r].id]==0){ sum++; } b[a[r].id]++; while(b[a[l].id]>1){ b[a[l].id]--; l++; } if(sum==n/3){ maxx=0,minn=1000000005; for(int i=l;i<=r;i++){ maxx=max(maxx,a[i].x); minn=min(minn,a[i].x); } ans=min(ans,maxx-minn); } } cout<<ans; }