def _antidivisors(n):
 for d in _divisors(n):
  y = (2 * d)
  if ((n > y) and (n % y)):
   (yield y)
 for d in _divisors(((2 * n) - 1)):
  if ((n > d >= 2) and (n % d)):
   (yield d)
 for d in _divisors(((2 * n) + 1)):
  if ((n > d >= 2) and (n % d)):
   (yield d)

def _antidivisors ( n ) : for d in _divisors ( n ) : y = ( 2 * d ) if ( ( n > y ) and ( n % y ) ) : ( yield y ) for d in _divisors ( ( ( 2 * n ) - 1 ) ) : if ( ( n > d >= 2 ) and ( n % d ) ) : ( yield d ) for d in _divisors ( ( ( 2 * n ) + 1 ) ) : if ( ( n > d >= 2 ) and ( n % d ) ) : ( yield d )
helper function for antidivisors which generates the antidivisors .