why the complexity of Key-indexed counting algorithm is 11N + 4R?


I am asking about the complexity of Key-indexed counting algorithm is 11N + 4R, I want to know from where 11 came from

this is the steps of the algorithm

int N = a.length; int[] count = new int[R+1];  for (int i = 0; i < N; i++)      count[a[i]+1]++;  for (int r = 0; r < R; r++)     count[r+1] += count[r];  for (int i = 0; i < N; i++)     aux[count[a[i]]++] = a[i];  for (int i = 0; i < N; i++)     a[i] = aux[i]; 

Thanks in advance