What is the overall time complexity of the following code segment, which inserts n elements into the middle of an ArrayList?

import java.util.ArrayList;
public class Test {
    public static void main(String[] args) {
        ArrayList<Integer> list = new ArrayList<>();
        int n = 100; // assume n elements
        for (int i = 0; i < n; i++) {
            int mid = list.size() / 2;
            list.add(mid, i);
        }
    }
}