Sort Node<T> LinkedList, Merge Sort

Merge-sort-Input.cs

static Node<int> SortInput()
{
    Console.WriteLine("Insert Value | Insert '-999' to stop");
    int value = int.Parse(Console.ReadLine());
    Node<int> node = new Node<int>(value);
    while (value != -999)
    {
      node.SetNext(new Node<int>(value));
      Console.WriteLine("Insert Value | Insert '-999' to stop");
      value = int.Parse(Console.ReadLine());
      node = node.GetNext();
    }
    return Sort(node);
}
static Node<int> Sort(Node<int> node)
{
    while(node.HasNext())
    {
    Node<int> temp;
    if(node.GetValue() >= node.GetNext().GetValue())
    {
      temp = node;
      node = node.GetNext();
      node.SetNext(temp); 
     }
    node = node.GetNext();
    }
    return node;
}