We consider the matching problem on the line with advice complexity. We give a 1-competitive online algorithm with advice complexity n−1, and show that there is no 1-competitive online algorithm reading less than n−1 bits of advice. Moreover, for each 0<k<n we present a c(n/k)-competitive online algorithm with advice complexity O(k(logN+logn)) where n is the number of servers, N is the distance of the minimal and maximal servers, and c(n) is the complexity of the best online algorithm without advice.