#include<bits/stdc++.h> using namespace std; const int N = 105; struct com{ int a, b, g; }a[N]; int n; int ans = 0; int dfs(int t){ int res = 0, tmp = t; //tmp表示当前鹅卵石的位置 for(int i = 1;i <= n;i ++){ if(a[i].a == tmp){ tmp = a[i].b; } else if(a[i].b == tmp){ tmp = a[i].a; } if(tmp == a[i].g){ res ++; } } return res; } int main(){ cin >> n; for(int i = 1;i <= n;i ++){ cin >> a[i].a >> a[i].b >> a[i].g; } ans = max(max(dfs(1), dfs(2)), dfs(3)); cout << ans; }