#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::{Write, BufWriter};
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, [ $t:tt ]) => {{
        let len = read_value!($next, usize);
        (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    }};

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused)]
macro_rules! debug {
    ($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap());
}
#[allow(unused)]
macro_rules! debugln {
    ($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).unwrap());
}

fn calc(s: &[char]) -> (i64, i64) {
    assert_eq!(s[0], 'p');
    let mut has_h = false;
    for i in 0..s.len() {
        if s[i] == 'h' {
            has_h = true;
        }
    }
    let st;
    if s.len() >= 4 && &s[1..4] == &['e', 'n', 'h'] {
        st = 4;
    } else if s.len() >= 3 && &s[1..3] == &['h', 'n'] {
        st = 3;
    } else {
        return (0, 0);
    }
    let mut cur = st;
    while cur <= s.len() - 2 && &s[cur..cur + 2] == &['o', 'm'] {
        cur += 2;
    }
    let x = (cur - st) as i64 / 2;
    if st == 4 {
        return (x, x + 1 + if has_h { 1 } else { 0 });
    }
    (x, x + if has_h { 1 } else { 0 })
}

fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {
        ($($format:tt)*) => (let _ = write!(out,$($format)*););
    }
    input!(s: chars);
    let mut tot = 0;
    let mut ma = 0;
    let mut cur = None;
    for i in 0..s.len() + 1 {
        if i == s.len() || s[i] == 'p' {
            if let Some(pre) = cur {
                let (x, y) = calc(&s[pre..i]);
                tot += x;
                ma = max(ma, y);
            }
            cur = Some(i);
        }
    }
    puts!("{}\n", tot + ma);
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}