input: Write a function to determine if it is possible to get a 3-dimensional vector sorted in increasing order by performing any number of right shift operations on the given vector. If it is possible return True else return False. If the given vector is empty then return True.
  assert move_one_vector(Vector(3, 4, 5))==True
  assert move_one_vector(Vector(3, 5, 4))==True
  assert move_one_vector(Vector(4, 3, 1))==False
  assert move_one_vector(Vector(3, 5, 4))==False
  assert move_one_vector(Vector(3, 3, 3))==True
  assert move_one_vector(Vector(0, 0, 0))==True
output: def move_one_vector(vec):
      if not vec:
          return True
      vec = sorted(vec)
      for i in range(3):
          if vec == sorted(vec[i:] + vec[:i]):
              return True
      return False