#include<iostream>

#include<cstdio>

#include<cstring>

#include<queue>

using namespace std;

inline int Abs(int a){return a<?-a:a;}

#define N 5005

#define W 500005

int n,m,S,T,tF,tC,a[N],d[N],p[N]; bool inh[N];

int cnt=,hd[N],nxt[W],ed[N],poi[W],val[W],cst[W];

queue <int> h;

inline void adde(int x,int y,int v1,int v2){

    nxt[ed[x]]=++cnt, hd[x]=hd[x]?hd[x]:cnt,

    ed[x]=cnt, poi[cnt]=y, val[cnt]=v1, cst[cnt]=v2;

}

inline void link(int x,int y,int v1,int v2){adde(x,y,v1,v2),adde(y,x,,-v2);}

bool bfs(){

    memset(d,,sizeof(d)); int inf=d[];

    h.push(S); a[S]=inf; d[S]=; inh[S]=;

    while(!h.empty()){

        int x=h.front(); h.pop(); inh[x]=;

        for(int i=hd[x];i;i=nxt[i]){

            int to=poi[i];

            if(val[i]>&&d[to]>d[x]+cst[i]){

                d[to]=d[x]+cst[i]; p[to]=i;

                a[to]=min(a[x],val[i]);

                if(!inh[to]) h.push(to),inh[to]=;

            }

        }

    }if(d[T]==inf) return ;

    tF+=a[T]; tC+=a[T]*d[T];

    for(int i=T;i!=S;i=poi[p[i]^])

        val[p[i]]-=a[T],val[p[i]^]+=a[T];

    return ;

}

int main(){

    scanf("%d",&n); int id,l,r,c;

    S=n*+; T=S+;

    for(int i=;i<=n;++i) link(S,i,,);

    for(int i=n+;i<=n+n;++i) link(i,T,,);

    for(int i=;i<=n;++i){

        scanf("%d%d%d%d",&id,&l,&r,&c);

        for(int j=l;j<=r;++j)

            link(i,j+n,,c*Abs(id-j));

    }while(bfs());

    if(tF<n) puts("NIE");

    else printf("%d",tC);

    return ;

}