title: Position Of Rightmost Set Bit 1
signature: positionOfRightmostSetBit1 :: Integer -> Integer
  positionOfRightmostSetBit1 n = 
test_code: import Text.Printf
  import Control.Exception (catch, SomeException)
  import Data.Typeable
  import qualified Data.List as List
  import qualified Data.Map as Map
  import qualified Data.Set as Set
  
  -- SOLUTION CODE
  -- ============================================
  
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  validateSolution :: Integer -> Integer -> Bool
  validateSolution actual expected = do
      actual == expected
  
  
  driver :: Integer -> Integer -> String
  driver n expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME n) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver (17) (1) )
  
      printf "TEST-1...%s\n" (driver (97) (1) )
  
      printf "TEST-2...%s\n" (driver (73) (1) )
  
      printf "TEST-3...%s\n" (driver (68) (3) )
  
      printf "TEST-4...%s\n" (driver (6) (2) )
  
      printf "TEST-5...%s\n" (driver (84) (3) )
  
      printf "TEST-6...%s\n" (driver (72) (4) )
  
      printf "TEST-7...%s\n" (driver (66) (2) )
  
      printf "TEST-8...%s\n" (driver (57) (1) )
  
      printf "TEST-9...%s\n" (driver (11) (1) )
  
source_py: def position_of_rightmost_set_bit_1(n):
      position = 1
      m = 1
      while (not (n & m)):
          m = (m << 1)
          position += 1
      return position
source_cpp: int position_of_rightmost_set_bit_1(int n) {
    int position = 1;
    int m = 1;
    while ( ! ( n & m ) ) {
      m = m << 1;
      position ++;
    }
    return position;
  }