#include<cstdio>

typedef long long ll;

const int N=110,M=200010,P=1000003;

int n,m,i,j,k,x,y,in[N],ou[N],vis[N],g[N][N];ll f[M],a[N][N],ans;

inline void read(int&a){char c;while(!(((c=getchar())>='0')&&(c<='9')));a=c-'0';while(((c=getchar())>='0')&&(c<='9'))(a*=10)+=c-'0';}

void dfs(int x){

  vis[x]=++m;

  for(int i=1;i<=n;i++)if(g[x][i]&&!vis[i])dfs(i);

}

inline void swap(ll&a,ll&b){ll c=a;a=b;b=c;}

ll det(int n){

  ll ans=1;bool flag=1;

  for(i=1;i<=n;i++)for(j=1;j<=n;j++)a[i][j]=(a[i][j]%P+P)%P;

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

    for(j=i+1;j<=n;j++)while(a[j][i]){

      ll t=a[i][i]/a[j][i];

      for(k=i;k<=n;k++)a[i][k]=(a[i][k]+P-t*a[j][k]%P)%P;

      for(k=i;k<=n;k++)swap(a[i][k],a[j][k]);

      flag^=1;

    }

    ans=ans*a[i][i]%P;

    if(!ans)return 0;

  }

  if(!flag)ans=P-ans;

  return ans;

}

int solve(){

  for(m=0,i=1;i<=n;i++)in[i]=ou[i]=vis[i]=0;

  for(i=0;i<=n;i++)for(j=0;j<=n;j++)a[i][j]=g[i][j]=0;

  int ed=0;

  for(i=1;i<=n;i++)for(read(k);k--;g[i][j]++)read(j),ed++;

  for(dfs(i=1);i<=n;i++)if(!vis[i]&&g[i])return 0;

  for(i=1;i<=n;i++)for(j=1;j<=n;j++)if(g[i][j]){

    x=vis[i],y=vis[j];

    ou[x]+=g[i][j];in[y]+=g[i][j];

    a[x-1][y-1]-=g[i][j],a[x-1][x-1]+=g[i][j];

  }

  for(i=1;i<=m;i++)if(in[i]!=ou[i])return 0;

  if(m==1)return f[g[1][1]];

  ans=det(m-1)*in[1];

  for(i=1;i<=m;i++)ans=ans*f[in[i]-1]%P;

  return ans;

}

int main(){

  for(f[0]=i=1;i<M;i++)f[i]=f[i-1]*i%P;

  while(1){

    read(n);

    if(!n)return 0;

    printf("%d\n",solve());

  }

}