/**************************************************************

     Problem: 1520

     User: Tunix

     Language: C++

     Result: Accepted

     Time:1452 ms

     Memory:5964 kb

 ****************************************************************/

 //BZOJ 1520

 #include<vector>

 #include<cstdio>

 #include<cstring>

 #include<cstdlib>

 #include<iostream>

 #include<algorithm>

 #define rep(i,n) for(int i=0;i<n;++i)

 #define F(i,j,n) for(int i=j;i<=n;++i)

 #define D(i,j,n) for(int i=j;i>=n;--i)

 #define pb push_back

 using namespace std;

 inline int getint(){

     int v=,sign=; char ch=getchar();

     while(ch<''||ch>''){ if (ch=='-') sign=-; ch=getchar();}

     while(ch>=''&&ch<=''){ v=v*+ch-''; ch=getchar();}

     return v*sign;

 }

 const int N=,M=,INF=~0u>>;

 typedef long long LL;

 /******************tamplate*********************/

 int n,ans,flow;

 struct edge{int from,to,v,c;};

 struct Net{

     edge E[M];

     int head[N],next[M],cnt;

     void ins(int x,int y,int z,int c){

         E[++cnt]=(edge){x,y,z,c};

         next[cnt]=head[x]; head[x]=cnt;

     }

     void add(int x,int y,int z,int c){

         ins(x,y,z,c); ins(y,x,,-c);

     }

     int from[N],Q[M],d[N],S,T,ed;

     bool inq[N],sign;

     bool spfa(){

         int l=,r=-;

         F(i,,T) d[i]=INF;

         d[S]=; Q[++r]=S; inq[S]=;

         while(l<=r){

             int x=Q[l++];

             inq[x]=;

             for(int i=head[x];i;i=next[i])

                 if(E[i].v> && d[x]+E[i].c<d[E[i].to]){

                     d[E[i].to]=d[x]+E[i].c;

                     from[E[i].to]=i;

                     if (!inq[E[i].to]){

                         Q[++r]=E[i].to;

                         inq[E[i].to]=;

                     }

                 }

         }

         return d[T]!=INF;

     }

     void mcf(){

         int x=INF;

         for(int i=from[T];i;i=from[E[i].from])

             x=min(x,E[i].v);

         for(int i=from[T];i;i=from[E[i].from]){

             E[i].v-=x;

             E[i^].v+=x;

         }

         flow+=x;

         ans+=x*d[T];

     }

     void init(){

         n=getint(); cnt=;

         S=; T=n*+;

         int m,x,y,k;

         F(i,,n){

             m=getint(); x=getint(); y=getint(); k=getint();

             add(S,i,,);

             F(j,x,y) add(i,j+n,,k*abs(j-m));

             add(i+n,T,,);

         }

         while(spfa()) mcf();

         if (flow==n) printf("%d\n",ans);

         else printf("NIE");

     }

 }G1;

 int main(){

 #ifndef ONLINE_JUDGE

     freopen("1520.in","r",stdin);

     freopen("1520.out","w",stdout);

 #endif

     G1.init();

     return ;

 }