title: Position Of Rightmost Set Bit 1
signature: function position_of_rightmost_set_bit_1(n)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(n, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(n), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver(17, 1);
      @printf("TEST-0...%s\n",result);
      
      result = driver(97, 1);
      @printf("TEST-1...%s\n",result);
      
      result = driver(73, 1);
      @printf("TEST-2...%s\n",result);
      
      result = driver(68, 3);
      @printf("TEST-3...%s\n",result);
      
      result = driver(6, 2);
      @printf("TEST-4...%s\n",result);
      
      result = driver(84, 3);
      @printf("TEST-5...%s\n",result);
      
      result = driver(72, 4);
      @printf("TEST-6...%s\n",result);
      
      result = driver(66, 2);
      @printf("TEST-7...%s\n",result);
      
      result = driver(57, 1);
      @printf("TEST-8...%s\n",result);
      
      result = driver(11, 1);
      @printf("TEST-9...%s\n",result);
      
  end
  
  main()
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;
  }