let consider the
case1:- n is even
then we will focus on the permutation n/2 bits and remaining n/2 will arrange in one way...i.e 2n/2
case2;- n is not even
then we will calculate the permutation of n-1/2 bits ...and remaining n-1/2 bits could arrange in one way..
middle bits could be 0 or 1 ,...therefor total number of palindrome with n-odd would be 2 n-1 /2 *2 => 2 ((n-1) /2) +1
=>2 n+1 /2 or we can write it as 2 ceil(n/2)