left shift

In a left shift a << n, bits in a are shifted to the left, which is equivalent to multiplying it by $2^n$. The leftmost $n$ bits are discarded if they are beyond the size of the a.