import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;

alias Point = Tuple!(int, "x", int, "t");

void main() {
    int n;
    scan(n);

    auto p = new Point[](2*n);

    foreach (i ; 0 .. n) {
        int ai, bi;
        scan(ai, bi);
        p[2*i] = Point(ai, 0);
        p[2*i + 1] = Point(bi, 1);
    }

    p.sort();

    int ans;
    int tmp;

    foreach (i ; 0 .. 2*n) {
        if (p[i].t == 0) {
            tmp++;
            ans = max(ans, tmp);
        }
        else {
            tmp--;
        }
    }

    writeln(ans);
}



void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}


void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}
