public String f(int n) { if (n==0) return ""; String s = f(n/2); if (n%2 ==0) return s+s; else return s + s + "x"; }

For call f(16). How many recursive calls are made to f (including the initial call)