Let B be the set of all binary integers that can be written using exactly 5 zeros and 8 ones where leading zeros are allowed. If all possible subtractions are performed in which one element of B is subtracted from another, find the number of times the answer 1 is obtained.