use std::collections::BTreeSet;

fn main() {
    let mut sc = Scanner::new();
    let n = sc.usize();
    let m = sc.usize();
    let edges = sc.edges(m);

    let mut ecnt = vec![0; n];

    let mut uni = UnionFind::new(n);
    let mut in_cnt = vec![0; n];
    let mut out_cnt = vec![0; n];
    for &(a, b) in &edges {
        out_cnt[a] += 1;
        in_cnt[b] += 1;
        uni.merge(a, b);
        ecnt[uni.root(a)] = ecnt[a] + ecnt[b] + 1;
    }
    // for i in 0..n { eprintln!("{} : {} {}", i, in_cnt[i], out_cnt[i]); }

    let mut ng = BTreeSet::new();
    for i in 0..n {
        if in_cnt[i] == out_cnt[i] { continue }
        ng.insert((in_cnt[i] - out_cnt[i], i));
    }


    let mut ans = 0;
    while ng.len() > 2 {
        let (max, i) = *ng.iter().next_back().unwrap();
        let (min, j) = *ng.iter().next().unwrap();

        if signum(max) == signum(min) { break }

        let diff = max.min(-min);
        ng.remove(&(max, i));
        ng.remove(&(min, j));
        out_cnt[i] += diff;
        in_cnt[j] += diff;
        ans += diff;

        if max > diff {
            if max - diff != 0 { ng.insert((max - diff, i)); }
        } else {
            if min + diff != 0 { ng.insert((min + diff, j)); }
        }
    }

    let mut g = 0;
    for i in 0..n {
        if ecnt[uni.root(i)] == 0 { continue }
        if uni.root(i) != i { continue }
        g += 1;
    }
    ans += g - 1;



    if ng.len() == 0 {
        println!("{}", ans);
    } else if ng.len() == 1 {
        let (c, _) = *ng.iter().next().unwrap();
        println!("{}", ans + 1.max(c));
    } else if ng.len() == 2 {
        let (max, _) = *ng.iter().next_back().unwrap();
        let (min, _) = *ng.iter().next().unwrap();
        if signum(max) == signum(min) {
            println!("{}", ans + max.abs() + min.abs());
        } else {
            if max == -min { println!("{}", ans + max.abs() - 1); }
            else {
                let diff = max.min(-min);
                let m = max.max(-min);
                println!("{}", ans + diff + (m - diff));
            }
        }
    }
}

fn signum(x: i64) -> i64 {
    if x == 0 { 0 } else if x > 0 { 1 } else { -1 }
}


struct Scanner { s : std::collections::VecDeque<String> } #[allow(unused)] impl Scanner { fn new() -> Self { use std::io::Read; let mut s = String::new(); std::io::stdin().read_to_string(&mut s).unwrap(); Self { s : s.split_whitespace().map(|s| s.to_string()).collect() } } fn reload(&mut self) -> () { use std::io::Read; let mut s = String::new(); std::io::stdin().read_to_string(&mut s).unwrap(); self.s = s.split_whitespace().map(|s| s.to_string()).collect(); } fn usize(&mut self) -> usize { self.input() } fn usize1(&mut self) -> usize { self.input::<usize>() - 1 } fn isize(&mut self) -> isize { self.input() } fn i32(&mut self) -> i32 { self.input() } fn i64(&mut self) -> i64 { self.input() } fn i128(&mut self) -> i128 { self.input() } fn u8(&mut self) -> u8 { self.input() } fn u32(&mut self) -> u32 { self.input() } fn u64(&mut self) -> u64 { self.input() } fn u128(&mut self) -> u128 { self.input() } fn edge(&mut self) -> (usize, usize) { (self.usize1(), self.usize1()) } fn edges(&mut self, m : usize) -> Vec<(usize, usize)> { let mut e = Vec::with_capacity(m); for _ in 0..m { e.push(self.edge()); } e } fn wedge<T:std::str::FromStr>(&mut self) -> (usize, usize, T) { (self.usize1(), self.usize1(), self.input()) } fn wedges<T:std::str::FromStr>(&mut self, m : usize) -> Vec<(usize, usize, T)> { let mut e = Vec::with_capacity(m); for _ in 0..m { e.push(self.wedge()); } e } fn input<T>(&mut self) -> T where T: std::str::FromStr { if self.s.is_empty() { self.reload(); } if let Some(head) = self.s.pop_front() { head.parse::<T>().ok().unwrap() } else { panic!() } } fn tuple<T, U>(&mut self) -> (T, U) where T: std::str::FromStr, U: std::str::FromStr { (self.input(), self.input()) } fn vec<T>(&mut self, n: usize) -> Vec<T> where T: std::str::FromStr { if self.s.is_empty() { self.reload(); } self.s.drain(..n).map(|s| s.parse::<T>().ok().unwrap() ).collect::<Vec<T>>() } fn nvec<T>(&mut self) -> Vec<T> where T: std::str::FromStr { let n : usize = self.input(); self.vec(n) } fn chars(&mut self) -> Vec<char> { let s : String = self.input(); s.chars().collect() } fn bytes(&mut self) -> Vec<u8> { let s : String = self.input(); s.bytes().collect() } }

struct UnionFind { per : Vec<Option<usize>>, size : Vec<usize> } #[allow(dead_code)] impl UnionFind { fn new (n : usize) -> Self { Self { per : vec![None; n+1], size: vec![1; n+1]} } fn root (&mut self, x : usize) -> usize { if let Some(y) = self.per[x] { let res = self.root(y); self.per[x] = Some(res); res } else { x } } fn merge(&mut self, mut x : usize, mut y : usize) -> bool { x = self.root(x); y = self.root(y); if x == y { return false; } if self.size[x] < self.size[y] { std::mem::swap(&mut x, &mut y); } self.per[y] = Some(x); self.size[x] += self.size[y]; true } fn same(&mut self, x : usize, y : usize) -> bool { self.root(x) == self.root(y) } fn size(&mut self, x : usize) -> usize { let x = self.root(x); self.size[x] } }