There are x friends, each one want to eat either pizza or tacos, if one in a group of friends doesn't want to eat what the others he can change its desired food or maintain it, if he doesn't change there is an akward feeling in the group, if he change he has a akward feeling itself, we want to obtain the least amount of award felling in total, models te this as a maximum flow problem