Your challenge this week is to implement basic arithmetic for a different type of number representation. Instead of each bit representing a power of 2, each bit will represent a number. Only one bit will be set in any integer. The first few numbers are:

// Implement the following stubs using our numbering system
// described above.
// Ignore negatives and bits falling off either end
// Functions should be fast and use as little memory as possible
// as they will be called often.
// Functions should be generic and not employ some trick
// that only works for 32-bit numbers.
unsigned int add( unsigned int n1, unsigned int n2 ); 
// n1 >= n2
unsigned int subtract( unsigned int n1, unsigned int n2 );
unsigned int multiply( unsigned int n1, unsigned int n2 );
//n2 != 0
unsigned int divide( unsigned int n1, unsigned int n2 );