A hypergraph H=(V(H),E(H)) is a Berge copy of graph F, if V(F)⊂V(H) and there bijection f:E(F)→E(H) such that for any e∈E(F) we have e⊂f(e). Berge-F-free it does not contain copies F. We address the saturation problem concerning hypergraphs, i.e. what minimum number satr(n,Berge-F) hyperedges in an r-uniform H with property adding new hyperedge (of size r) to creates F? prove grows linearly n F...