public int[] findStones(int maxWeight) {		
		for(int i = 1; i <= maxWeight; i++) {
			for(int j = i + 1; j <= maxWeight; j++) {
				for(int k = j + 1; k <= maxWeight; k++) {
					int l = maxWeight - i - j - k;
					
					if(i < j && j < k && k < l) {
						int[] stones = new int[4];
						stones[0] = i;
						stones[1] = j;
						stones[2] = k;
						stones[3] = l;
						
						boolean result = isMeasurable(stones, maxWeight); 
						if(result) {
							return stones;
						}
					} else {
						continue;
					}
				}
			}
		}
		
		return null;
	}