gistfile1.txt

def divTwo(x):
  out = 0
  while (x > 0):
    n = 1
    n2 = n
    while (x >= (n+n)):
      n2 = n
      n = (n + n)
    out = (out + (n - n2))
    x = (x - n)
  return out

# modulo
def Mod(dividend, divisor):
  initialdiv = divisor
  while (dividend > divisor):
    divisor = (divisor + divisor)
  if (((divisor - dividend) == initialdiv) or ((divisor - dividend) == 0)):
    x = 0
  else:
    if ((divisor - dividend) > initialdiv):
      x = Mod((divisor - dividend), initialdiv)
    else:
      x = (divisor - dividend)
  return x