// We negate in 2 steps to avoid signed subtraction overflow,
// Since the minimum signed integer cannot be represented as positive so long as its type is signed, and it's not well-defined what happens if you make it unsigned before negating it, we instead increment the negative integer by 1, convert it, then increment the (now positive) unsigned integer by 1 to compensate
// i.e. -(-2^63), which is an undefined operation and causes SIGILL
n=-(sn+1);
// when compiled with -ftrapv.
++n;
//
// Note that uint64_t n = sn, when sn is an int64_t, is a
// well-defined operation and n will be equal to sn + 2^64 when sn