I need to do some math with arithmetic movements in binary codes. I have one question, if for example I have a number that is represented as inverted code, for example:

+26 is 00011010

-26 is 11100101

What I need to do is to make a scheme, that does Arithmetic movement to left by one. So if I have a negative number represented in inverted code, how can I describe the new number with arithmetic movement to left by one?

If I have X1X2X3X4X5 then when I do that movement, it becomes X2X3X4X5X1 ? (I mean the first bit goes to last one? Cause I know if number is positive, then we need to write 0, if not, then 1, so I guess it depends on the first bit of number, am I wrong?)