Leanid Lahun
Leanid Leanidovich Lahun (Belarusian: Леанід Леанідавіч Лагун; Russian: Леонид Леонидович Лагун; born 22 June 1978) is a Belarusian football coach and former player.
Personal information | |||
---|---|---|---|
Full name | Leanid Leanidovich Lahun | ||
Date of birth | 22 June 1978 | ||
Place of birth | Minsk, Belarusian SSR | ||
Height | 1.85 m (6 ft 1 in) | ||
Playing position(s) | Midfielder | ||
Club information | |||
Current team | Slonim-2017 (manager) | ||
Youth career | |||
Torpedo Minsk | |||
Senior career* | |||
Years | Team | Apps | (Gls) |
1994–1995 | Smena Minsk | 22 | (3) |
1996 | Zvezda Minsk | 26 | (17) |
1997–2001 | BATE Borisov | 72 | (19) |
1997–1999 | → Smena-BATE Minsk | 51 | (16) |
2001–2002 | Torpedo Moscow | 4 | (0) |
2003 | Tom Tomsk | 33 | (4) |
2004 | SKA-Energiya Khabarovsk | 31 | (1) |
2005 | Shakhtyor Soligorsk | 1 | (0) |
2006 | Dynamo Bryansk | 11 | (0) |
2007 | Vitebsk | 1 | (0) |
2009 | Rudensk | 20 | (2) |
Teams managed | |||
2017 | Neman-Agro Stolbtsy | ||
2018 | Torpedo Minsk | ||
2019– | Slonim-2017 | ||
* Senior club appearances and goals counted for the domestic league only |
Honours
BATE Borisov
- Belarusian Premier League champion: 1999
Shakhtyor Soligorsk
- Belarusian Premier League champion: 2005
gollark: It's in unsafe™ C, so you could make a mistake and doom all mankind.
gollark: Well, it's generic, obviously safer, and appears to involve less weird pointer meddling.
gollark: And 🦀Safe Rust™🦀.
gollark: See, this is much nicer.
gollark: ```rustpub struct List<T> { head: Link<T>,}type Link<T> = Option<Box<Node<T>>>;struct Node<T> { elem: T, next: Link<T>,}impl<T> List<T> { pub fn new() -> Self { List { head: None } } pub fn push(&mut self, elem: T) { let new_node = Box::new(Node { elem: elem, next: self.head.take(), }); self.head = Some(new_node); } pub fn pop(&mut self) -> Option<T> { self.head.take().map(|node| { self.head = node.next; node.elem }) }}impl<T> Drop for List<T> { fn drop(&mut self) { let mut cur_link = self.head.take(); while let Some(mut boxed_node) = cur_link { cur_link = boxed_node.next.take(); } }}```
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.