/* やっと交わった運命線 もう離さない
 * rbtree (https://rbtr.ee)
 * z1qqurat (https://z1qqur.at)
 * Email [email protected]
 
         __    __                            ___                             __
   _____/ /_  / /_________  ___        ____ <  /___ _____ ___  ___________ _/ /_
  / ___/ __ \/ __/ ___/ _ \/ _ \      /_  / / / __ `/ __ `/ / / / ___/ __ `/ __/
 / /  / /_/ / /_/ /  /  __/  __/       / /_/ / /_/ / /_/ / /_/ / /  / /_/ / /_
/_/  /_.___/\__/_/   \___/\___/       /___/_/\__, /\__, /\__,_/_/   \__,_/\__/
                                               /_/   /*/
#include <bits/stdc++.h>
#define __NO_MAIN__ false
constexpr bool MTS = false, SPC_MTS = false;
#define FULL(arg) arg.begin(), arg.end()

// :/

using namespace std;
using tp = long long int;
[[maybe_unused]] constexpr tp ZERO = 0, ONE = 1, INF = -1ull >> 3;
int WITHERING(unsigned long long int);
void MIST();

#if !__NO_MAIN__
int main(int argc,char* argv[]){unsigned long long int t=0,_t=1;if(MTS&&!SPC_MTS
) cin >>_t;MIST();while(t<_t||SPC_MTS){if(WITHERING(++t)!=0)return 0;}return 0;}
#endif
template <typename _Ty> class _Lambda_t {_Ty lexp;public:template<typename __Ty>
_Lambda_t(__Ty&&lexp):lexp(static_cast<__Ty&&>(lexp)){}template<typename... __Ty
>decltype(auto)operator()(__Ty&&...args){return lexp(std::ref(*this),static_cast
<__Ty&&>(args)...); } }; template <typename _Ty> decltype(auto) lexp(_Ty&&l_exp)
{ return _Lambda_t<typename std::decay<_Ty>::type>(static_cast<_Ty&&>(l_exp)); }
template <typename _Ty1, typename _Ty2> bool ckmax(_Ty1& a, const _Ty2& b) { if(
a<b){a=b; return true; } return false; } template <typename _Ty1, typename _Ty2>
bool ckmin(_Ty1&a,const _Ty2&b){if(b < a) { a = b; return true; } return false;}
#ifdef XCODE
#define bg(...){cout<<"["<<__LINE__<<'@'<<++_LT[__LINE__]<<':';BG(__VA_ARGS__);}
size_t _LT[21777]; template<typename _Type>void BG(const _Type&_cur){cout<<' '<<
_cur << ']' <<" <<:"<<std::endl;}template<typename _Type,typename... _Other>void
BG(const _Type& _cur, const _Other& ..._other) {cout<< ' '<<_cur;BG(_other...);}
#else
#define bg(...)
#endif

// :/

// :/

struct STRUGGLE {
   STRUGGLE() {
      cin.tie(nullptr)->sync_with_stdio(false);
   }
   
   ~STRUGGLE() {
   }
} STRUGGLE;

void MIST() {
}

int WITHERING([[maybe_unused]] unsigned long long int TEST_NUMBER) {
   tp n; cin >> n;
   vector<bitset<5003>> a(50);
   for (auto& i : a) i.reset();
   for (tp i = 0; i < n; ++i) {
      tp l; cin >> l;
      while (l--) {
         tp x; cin >> x;
         a[x - 1][i] = true;
      }
   }
   tp ans = 0;
   for (tp i = 1; i < n; ++i) {
      bitset<5003> cur;
      bitset<5003> tar;
      cur.reset();
      tar.reset();
      for (tp j = 0; j < 50; ++j) {
         cur ^= a[j];
         if (a[j][i]) {
            tar ^= cur;
            cur.reset();
         }
      }
      for (tp j = 0; j < i; ++j) {
         if (tar[j]) ++ans;
      }
   }
   cout << ans << '\n';
   return 0;
}

// :\ */