Let　r　＞=　3　and　k　＞=　2　be　fixed　integers.　Bollobas　and　Scott　conjectured　that　every　r-uniform　hypergraph　with　m　edges　has　a　vertex　partition　into　k　sets　with　at　most　m/k(r)+o(m)　edges　in　each　set,　and　proved　the　conjecture　in　the　case　r　=　3.　In　this　paper,　we　confirm　this　conjecture　in　the　case　r　=　4　by　showing　that　every　4-uniform　hypergraph　with　m　edges　has　a　vertex　partition　into　k　sets　with　at　most　m/k(4)　+　O(m(8/9))　edges　in　each　set.