import java.util.*;

public class Complexity
{
	public static void main(String args[])
	{
    final int max = 100000;
		System.out.println("ArrayList worst case,ArrayList best case,ArrayList real,LinkedList,Vector");

		final int OO = 4, RO = 4;

		int arrayListN = 16;
		int vectorN = 10;

		final int step = 1000;

		for (int i = 0; i != max+step; i+=step)
		{
			while (i > arrayListN)
				arrayListN = (arrayListN*3)/2+1;

			while (i > vectorN)
				vectorN *= 2;

			//System.out.print(i); // index
			//System.out.print(",");
			System.out.print(OO+RO+((i*3)/2+1)*RO);	// ArrayListWorstCase
			System.out.print(",");
			System.out.print(OO+RO+i*RO); // ArrayListBestCase
			System.out.print(",");
			System.out.print(OO+RO+arrayListN*RO); // ArrayListTrue
			System.out.print(",");
			System.out.print(OO+2*RO+(OO+3*RO)*i); // LinkedList
			System.out.print(",");
			System.out.print(OO+RO+vectorN*RO); // vectorTrue
			System.out.println();
		}
	}
}