Problem: One day mum asked Petya to sort his toys and get rid of some of them. Petya found a whole box of toy spiders. They were quite dear to him and the boy didn't want to throw them away. Petya conjured a cunning plan: he will glue all the spiders together and attach them to the ceiling. Besides, Petya knows that the lower the spiders will hang, the more mum is going to like it and then she won't throw his favourite toys away. Help Petya carry out the plan.

A spider consists of k beads tied together by k - 1 threads. Each thread connects two different beads, at that any pair of beads that make up a spider is either directly connected by a thread, or is connected via some chain of threads and beads.

Petya may glue spiders together directly gluing their beads. The length of each thread equals 1. The sizes of the beads can be neglected. That's why we can consider that gluing spiders happens by identifying some of the beads (see the picture). Besides, the construction resulting from the gluing process should also represent a spider, that is, it should have the given features. 

After Petya glues all spiders together, he measures the length of the resulting toy. The distance between a pair of beads is identified as the total length of the threads that connect these two beads. The length of the resulting construction is the largest distance between all pairs of beads. Petya wants to make the spider whose length is as much as possible.

<image> <image>

The picture two shows two spiders from the second sample. We can glue to the bead number 2 of the first spider the bead number 1 of the second spider. The threads in the spiders that form the sequence of threads of maximum lengths are highlighted on the picture.

Input

The first input file line contains one integer n (1 ≤ n ≤ 100) — the number of spiders. Next n lines contain the descriptions of each spider: integer ni (2 ≤ ni ≤ 100) — the number of beads, then ni - 1 pairs of numbers denoting the numbers of the beads connected by threads. The beads that make up each spider are numbered from 1 to ni.

Output

Print a single number — the length of the required construction.

Examples

Input

1
3 1 2 2 3


Output

2


Input

2
3 1 2 1 3
4 1 2 2 3 2 4


Output

4


Input

2
5 1 2 2 3 3 4 3 5
7 3 4 1 2 2 4 4 6 2 7 6 5


Output

7

Solution (in JAVA):

Solution:
//package codeforces.practice.oneVone.Nov06_2020;

import java.io.*;
import java.util.*;

public class B {
    static InputReader in;
    static PrintWriter out;

    public static void main(String[] args) {
        initReaderPrinter(true);
        //initReaderPrinter(false);
        //solve(in.nextInt());
        solve(1);
    }

    static void solve(int testCnt) {
        for (int testNumber = 0; testNumber < testCnt; testNumber++) {
            int n = in.nextInt();
            int ans = 0;
            for(int i = 0; i < n; i++) {
                int k = in.nextInt();
                List<Integer>[] adj = new List[k];
                for(int j = 0; j < k; j++) {
                    adj[j] = new ArrayList<>();
                }
                for(int j = 0; j < k - 1; j++) {
                    int u = in.nextInt() - 1;
                    int v = in.nextInt() - 1;
                    adj[u].add(v);
                    adj[v].add(u);
                }
                ans += diameterBFS(adj);
            }
            out.println(ans);
        }
        out.close();
    }

    static int diameterBFS(List<Integer>[] g) {
        if(g.length == 0) {
            return 0;
        }
        int startV = 0;
        int[] r = diameterBFSHelper(g, startV);
        return diameterBFSHelper(g, r[1])[0];
    }

    /*
        return an array r of size 2.
        r[0]: is the longest path that starts from startV;
        r[1]: is the node that is the furthest away from startV.
     */
    static int[] diameterBFSHelper(List<Integer>[] g, int startV) {
        Queue<Integer> q = new LinkedList<>();
        Set<Integer> visited = new HashSet<>();
        q.add(startV);
        visited.add(startV);

        int maxDistance = 0, maxDistanceNode = startV;
        while(q.size() > 0) {
            int sz = q.size();
            for(int i = 0; i < sz; i++) {
                int v = q.poll();
                for(int w : g[v]) {
                    if(!visited.contains(w)) {
                        q.add(w);
                        visited.add(w);
                        maxDistanceNode = w;
                    }
                }
            }
            maxDistance++;
        }
        return new int[]{maxDistance - 1, maxDistanceNode};
    }

    static void initReaderPrinter(boolean test) {
        if (test) {
            try {
                in = new InputReader(new FileInputStream("input.txt"));
                out = new PrintWriter(new FileOutputStream("output.txt"));
            } catch (IOException e) {
                e.printStackTrace();
            }
        } else {
            in = new InputReader(System.in);
            out = new PrintWriter(System.out);
        }
    }

    static class InputReader {
        BufferedReader br;
        StringTokenizer st;

        InputReader(InputStream stream) {
            try {
                br = new BufferedReader(new InputStreamReader(stream), 32768);
            } catch (Exception e) {
                e.printStackTrace();
            }
        }

        String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }

        Integer[] nextIntArray(int n) {
            Integer[] a = new Integer[n];
            for (int i = 0; i < n; i++) {
                a[i] = nextInt();
            }
            return a;
        }

        Long[] nextLongArray(int n) {
            Long[] a = new Long[n];
            for (int i = 0; i < n; i++) {
                a[i] = nextLong();
            }
            return a;
        }
    }
}