//Calculate the value 256 and test if it's zero
//If the interpreter errors on overflow this is where it'll happen
//++++++++[>++++++++<-]>[<++++>-]
//+<[>-<
/**/Not zero so multiply by 256 again to get 65536
/**/[>++++<-]>[<++++++++>-]<[>++++++++<-]
/**/+>[>
/******/# Print "32"
/******/++++++++++[>+++++<-]>+.-.[-]<
/**/<[-]<->] <[>>
/******/# Print "16"
/******/+++++++[>+++++++<-]>.+++++.[-]<
//<<-]] >[>
/**/# Print "8"
/**/++++++++[>+++++++<-]>.[-]<
//<-]<
//# Print " bit cells
//"
//+++++++++++[>+++>+++++++++>+++++++++>+<<<<-]>-.>-.+++++++.+++++++++++.<.
//>>.++.+++++++..<-.>>-
//Clean up used cells.
//[[-]<]l
/**/this is preceded by a tab
/******/two tabs
/**********/three tabs etcetera!